Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Maximum_cut> ?p ?o }
Showing triples 1 to 82 of
82
with 100 triples 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 wikiPageLength "13153".
- Maximum_cut wikiPageOutDegree "43".
- Maximum_cut wikiPageRevisionID "681743501".
- Maximum_cut wikiPageWikiLink 2-satisfiability.
- Maximum_cut wikiPageWikiLink APX.
- Maximum_cut wikiPageWikiLink Approximation_algorithm.
- Maximum_cut wikiPageWikiLink Approximation_ratio.
- Maximum_cut wikiPageWikiLink Bipartite_graph.
- Maximum_cut wikiPageWikiLink Category:Combinatorial_optimization.
- Maximum_cut wikiPageWikiLink Category:Computational_problems_in_graph_theory.
- Maximum_cut wikiPageWikiLink Category:Graph_theory_objects.
- Maximum_cut wikiPageWikiLink Category:NP-complete_problems.
- Maximum_cut wikiPageWikiLink Computers_and_Intractability.
- Maximum_cut wikiPageWikiLink Computers_and_Intractability:_A_Guide_to_the_Theory_of_NP-Completeness.
- Maximum_cut wikiPageWikiLink Constant-factor_approximation_algorithm.
- Maximum_cut wikiPageWikiLink Cut_(graph_theory).
- Maximum_cut wikiPageWikiLink Decision_problem.
- Maximum_cut wikiPageWikiLink Derandomization.
- Maximum_cut wikiPageWikiLink Dual_graph.
- Maximum_cut wikiPageWikiLink Gerhard_J._Woeginger.
- Maximum_cut wikiPageWikiLink Glossary_of_graph_theory.
- Maximum_cut wikiPageWikiLink Graph_(mathematics).
- Maximum_cut wikiPageWikiLink Journal_of_the_ACM.
- Maximum_cut wikiPageWikiLink Karps_21_NP-complete_problems.
- Maximum_cut wikiPageWikiLink Maximum_2-satisfiability.
- Maximum_cut wikiPageWikiLink Maximum_satisfiability_problem.
- Maximum_cut wikiPageWikiLink Method_of_conditional_probabilities.
- Maximum_cut wikiPageWikiLink Minimum_cut.
- Maximum_cut wikiPageWikiLink Minimum_k-cut.
- Maximum_cut wikiPageWikiLink NP-complete.
- Maximum_cut wikiPageWikiLink NP-completeness.
- Maximum_cut wikiPageWikiLink NP_(complexity).
- Maximum_cut wikiPageWikiLink Optimization_problem.
- Maximum_cut wikiPageWikiLink Partition_problem.
- Maximum_cut wikiPageWikiLink Planar_graph.
- Maximum_cut wikiPageWikiLink Randomized_algorithm.
- Maximum_cut wikiPageWikiLink Randomized_rounding.
- Maximum_cut wikiPageWikiLink Reducibility_among_combinatorial_problems.
- Maximum_cut wikiPageWikiLink Route_inspection_problem.
- Maximum_cut wikiPageWikiLink SIAM_J._Comput..
- Maximum_cut wikiPageWikiLink SIAM_Journal_on_Computing.
- Maximum_cut wikiPageWikiLink Semidefinite_programming.
- Maximum_cut wikiPageWikiLink Symposium_on_Foundations_of_Computer_Science.
- Maximum_cut wikiPageWikiLink Theoretical_computer_science.
- Maximum_cut wikiPageWikiLink Unique_games_conjecture.
- Maximum_cut wikiPageWikiLink Winding_number.
- Maximum_cut wikiPageWikiLink File:Max-cut.svg.
- Maximum_cut wikiPageWikiLinkText "0.5-approximation algorithm for Max-cut".
- Maximum_cut wikiPageWikiLinkText "Max Cut".
- Maximum_cut wikiPageWikiLinkText "Max cut".
- Maximum_cut wikiPageWikiLinkText "Maximum cut".
- Maximum_cut wikiPageWikiLinkText "maximum cut".
- Maximum_cut hasPhotoCollection Maximum_cut.
- Maximum_cut wikiPageUsesTemplate Template:Citation.
- Maximum_cut wikiPageUsesTemplate Template:Reflist.
- 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 hypernym Cut.
- Maximum_cut type Food.
- Maximum_cut type Algorithm.
- Maximum_cut type Object.
- 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 "Maximum cut".
- Maximum_cut sameAs Maximaler_Schnitt.
- Maximum_cut sameAs برش_بیشینه.
- Maximum_cut sameAs Coupe_maximum.
- Maximum_cut sameAs Maximale_snede.
- Maximum_cut sameAs m.04n598f.
- Maximum_cut sameAs Maksimalno_odsecanje.
- Maximum_cut sameAs Q942557.
- Maximum_cut sameAs Q942557.
- Maximum_cut wasDerivedFrom Maximum_cut?oldid=681743501.
- Maximum_cut depiction Max-cut.svg.
- Maximum_cut isPrimaryTopicOf Maximum_cut.