Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01469293n
Noun Concept
Categories: Combinatorial optimization, Graph connectivity
EN
cut
EN
In graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets. Wikipedia
English:
graph theory
Definitions
Relations
Sources
EN
In graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets. Wikipedia
In graph theory, partition of the vertices in two sets Wikidata
The partition of a graph’s vertices into two subgroups. Wiktionary
Partition of a graph’s vertices into two subgroups. Wiktionary (translation)
IS A
partition of a set
HAS KIND
maximum cut
minimum cut
FACET OF
graph theory
NAMED AFTER
cut
Wikipedia
EN
cut (graph theory)
Wikidata
EN
cut
Wiktionary
EN
cut
Wikipedia Redirections
EN
cut set, cut space, cutset, Graph-cut, Minimum vertex cut, S-t cut, size of the cut, sparsest cut, sparsest cut problem

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License