Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Gomory–Hu_tree> ?p ?o }
Showing triples 1 to 54 of
54
with 100 triples per page.
- Gomory–Hu_tree abstract "In combinatorial optimization, the Gomory–Hu tree of an undirected graph with capacities is a weighted tree that represents the minimum s-t cuts for all s-t pairs in the graph. The Gomory–Hu tree can be constructed in | V | − 1 minimum cut computations.".
- Gomory–Hu_tree wikiPageExternalLink cut-tree.
- Gomory–Hu_tree wikiPageExternalLink parallel-cuttree.html.
- Gomory–Hu_tree wikiPageID "24093092".
- Gomory–Hu_tree wikiPageLength "16627".
- Gomory–Hu_tree wikiPageOutDegree "27".
- Gomory–Hu_tree wikiPageRevisionID "705490346".
- Gomory–Hu_tree wikiPageWikiLink Andrew_V._Goldberg.
- Gomory–Hu_tree wikiPageWikiLink Category:Combinatorial_optimization.
- Gomory–Hu_tree wikiPageWikiLink Category:Graph_algorithms.
- Gomory–Hu_tree wikiPageWikiLink Category:Network_flow.
- Gomory–Hu_tree wikiPageWikiLink Combinatorial_optimization.
- Gomory–Hu_tree wikiPageWikiLink Cut_(graph_theory).
- Gomory–Hu_tree wikiPageWikiLink Cycle_basis.
- Gomory–Hu_tree wikiPageWikiLink Dual_graph.
- Gomory–Hu_tree wikiPageWikiLink File:Gomory–Hu_G.svg.
- Gomory–Hu_tree wikiPageWikiLink File:Gomory–Hu_Gp1.svg.
- Gomory–Hu_tree wikiPageWikiLink File:Gomory–Hu_Gp2.svg.
- Gomory–Hu_tree wikiPageWikiLink File:Gomory–Hu_Gp3.svg.
- Gomory–Hu_tree wikiPageWikiLink File:Gomory–Hu_Gp4.svg.
- Gomory–Hu_tree wikiPageWikiLink File:Gomory–Hu_Gp5.svg.
- Gomory–Hu_tree wikiPageWikiLink File:Gomory–Hu_T.svg.
- Gomory–Hu_tree wikiPageWikiLink File:Gomory–Hu_T1.svg.
- Gomory–Hu_tree wikiPageWikiLink File:Gomory–Hu_T2.svg.
- Gomory–Hu_tree wikiPageWikiLink File:Gomory–Hu_T3.svg.
- Gomory–Hu_tree wikiPageWikiLink File:Gomory–Hu_T4.svg.
- Gomory–Hu_tree wikiPageWikiLink File:Gomory–Hu_T5.svg.
- Gomory–Hu_tree wikiPageWikiLink Max-flow_min-cut_theorem.
- Gomory–Hu_tree wikiPageWikiLink Maximum_flow_problem.
- Gomory–Hu_tree wikiPageWikiLink Minimum_cut.
- Gomory–Hu_tree wikiPageWikiLink Planar_graph.
- Gomory–Hu_tree wikiPageWikiLink Ralph_E._Gomory.
- Gomory–Hu_tree wikiPageWikiLink Submodular_set_function.
- Gomory–Hu_tree wikiPageWikiLink Tree_(graph_theory).
- Gomory–Hu_tree wikiPageWikiLinkText "Gomory–Hu tree".
- Gomory–Hu_tree wikiPageUsesTemplate Template:Cite_book.
- Gomory–Hu_tree wikiPageUsesTemplate Template:Cite_journal.
- Gomory–Hu_tree wikiPageUsesTemplate Template:Reflist.
- Gomory–Hu_tree subject Category:Combinatorial_optimization.
- Gomory–Hu_tree subject Category:Graph_algorithms.
- Gomory–Hu_tree subject Category:Network_flow.
- Gomory–Hu_tree hypernym Tree.
- Gomory–Hu_tree type Plant.
- Gomory–Hu_tree type Algorithm.
- Gomory–Hu_tree type Redirect.
- Gomory–Hu_tree comment "In combinatorial optimization, the Gomory–Hu tree of an undirected graph with capacities is a weighted tree that represents the minimum s-t cuts for all s-t pairs in the graph. The Gomory–Hu tree can be constructed in | V | − 1 minimum cut computations.".
- Gomory–Hu_tree label "Gomory–Hu tree".
- Gomory–Hu_tree sameAs Q5581241.
- Gomory–Hu_tree sameAs شجرة_جوموري-هو.
- Gomory–Hu_tree sameAs ゴモリ・フー木.
- Gomory–Hu_tree sameAs m.07k6wtj.
- Gomory–Hu_tree sameAs Q5581241.
- Gomory–Hu_tree wasDerivedFrom Gomory–Hu_tree?oldid=705490346.
- Gomory–Hu_tree isPrimaryTopicOf Gomory–Hu_tree.