Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01233532n
Noun Concept
Categories: NP-complete problems, Computational problems in graph theory, Graph theory objects, Combinatorial optimization
EN
maximum cut  Approximation algorithms for the max-cut problem  bipartite subgraph  MAX-CUT  Max-Cut problem
EN
For a graph, a maximum cut is a cut whose size is at least the size of any other cut. Wikipedia
Definitions
Relations
Sources
EN
For a graph, a maximum cut is a cut whose size is at least the size of any other cut. Wikipedia
a cut of a graph whose size is at least the size of any other cut Wikidata
IS A
computational problem
cut
PART OF
Karp's 21 NP-complete problems
Wikipedia
EN
maximum cut
Wikidata
EN
maximum cut
Wikipedia Redirections
EN
Approximation algorithms for the max-cut problem, bipartite subgraph, MAX-CUT, Max-cut problem, Max cut, Max weight cut, Maxcut, Maximal cut
Wikidata Alias
EN
Max-Cut problem, Max-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