Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q942557> ?p ?o }
Showing triples 1 to 47 of
47
with 100 triples per page.
- Q942557 subject Q6465276.
- Q942557 subject Q7132783.
- Q942557 subject Q7481159.
- Q942557 subject Q8391417.
- Q942557 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.".
- Q942557 thumbnail Max-cut.svg?width=300.
- Q942557 wikiPageExternalLink maxcutpy.
- Q942557 wikiPageExternalLink wwwcompendium.
- Q942557 wikiPageExternalLink node85.html.
- Q942557 wikiPageWikiLink Q1065968.
- Q942557 wikiPageWikiLink Q141488.
- Q942557 wikiPageWikiLink Q1626444.
- Q942557 wikiPageWikiLink Q166507.
- Q942557 wikiPageWikiLink Q17080584.
- Q942557 wikiPageWikiLink Q1709878.
- Q942557 wikiPageWikiLink Q1734364.
- Q942557 wikiPageWikiLink Q174733.
- Q942557 wikiPageWikiLink Q20994323.
- Q942557 wikiPageWikiLink Q215206.
- Q942557 wikiPageWikiLink Q2269096.
- Q942557 wikiPageWikiLink Q2294516.
- Q942557 wikiPageWikiLink Q2878974.
- Q942557 wikiPageWikiLink Q3262192.
- Q942557 wikiPageWikiLink Q4596967.
- Q942557 wikiPageWikiLink Q4653447.
- Q942557 wikiPageWikiLink Q547823.
- Q942557 wikiPageWikiLink Q576728.
- Q942557 wikiPageWikiLink Q583461.
- Q942557 wikiPageWikiLink Q621751.
- Q942557 wikiPageWikiLink Q628036.
- Q942557 wikiPageWikiLink Q6465276.
- Q942557 wikiPageWikiLink Q6823704.
- Q942557 wikiPageWikiLink Q6865438.
- Q942557 wikiPageWikiLink Q6865465.
- Q942557 wikiPageWikiLink Q7132783.
- Q942557 wikiPageWikiLink Q7292010.
- Q942557 wikiPageWikiLink Q7390263.
- Q942557 wikiPageWikiLink Q7481159.
- Q942557 wikiPageWikiLink Q7661883.
- Q942557 wikiPageWikiLink Q7886950.
- Q942557 wikiPageWikiLink Q8391417.
- Q942557 wikiPageWikiLink Q901096.
- Q942557 wikiPageWikiLink Q938821.
- Q942557 wikiPageWikiLink Q984063.
- Q942557 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.".
- Q942557 label "Maximum cut".
- Q942557 depiction Max-cut.svg.
