Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Maximum_cut> ?p ?o. }
Showing items 1 to 35 of
35
with 100 items per page.
- Maximum_cut abstract "For a graph, a maximum cut is a cut whose size is at least the size of any other cut. The problem of finding a maximum cut in a graph is known as the max-cut problem.The problem can be stated simply as follows. One wants a subset S of the vertex set such that the number of edges between S and the complementary subset is as large as possible.There is a more advanced version of the problem called weighted max-cut. In this version each edge has a real number, its weight, and the objective is to maximize not the number of edges but the total weight of the edges between S and its complement. The weighted max-cut problem is often, but not always, restricted to non-negative weights, because negative weights can change the nature of the problem.".
- Maximum_cut thumbnail Max-cut.svg?width=300.
- Maximum_cut wikiPageExternalLink maxcutpy.
- Maximum_cut wikiPageExternalLink wwwcompendium.
- Maximum_cut wikiPageExternalLink node85.html.
- Maximum_cut wikiPageID "19636775".
- Maximum_cut wikiPageRevisionID "602080037".
- Maximum_cut hasPhotoCollection Maximum_cut.
- Maximum_cut subject Category:Combinatorial_optimization.
- Maximum_cut subject Category:Computational_problems_in_graph_theory.
- Maximum_cut subject Category:Graph_theory_objects.
- Maximum_cut subject Category:NP-complete_problems.
- Maximum_cut type Abstraction100002137.
- Maximum_cut type Attribute100024264.
- Maximum_cut type ComputationalProblemsInGraphTheory.
- Maximum_cut type Condition113920835.
- Maximum_cut type Difficulty114408086.
- Maximum_cut type NP-completeProblems.
- Maximum_cut type Problem114410605.
- Maximum_cut type State100024720.
- Maximum_cut comment "For a graph, a maximum cut is a cut whose size is at least the size of any other cut. The problem of finding a maximum cut in a graph is known as the max-cut problem.The problem can be stated simply as follows. One wants a subset S of the vertex set such that the number of edges between S and the complementary subset is as large as possible.There is a more advanced version of the problem called weighted max-cut.".
- Maximum_cut label "Coupe maximum".
- Maximum_cut label "Maximale snede".
- Maximum_cut label "Maximaler Schnitt".
- Maximum_cut label "Maximum cut".
- Maximum_cut sameAs Maximaler_Schnitt.
- Maximum_cut sameAs Coupe_maximum.
- Maximum_cut sameAs Maximale_snede.
- Maximum_cut sameAs m.04n598f.
- Maximum_cut sameAs Q942557.
- Maximum_cut sameAs Q942557.
- Maximum_cut sameAs Maximum_cut.
- Maximum_cut wasDerivedFrom Maximum_cut?oldid=602080037.
- Maximum_cut depiction Max-cut.svg.
- Maximum_cut isPrimaryTopicOf Maximum_cut.
