Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Gomory–Hu_tree> ?p ?o }
Showing triples 1 to 13 of
13
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 wikiPageID "24093092".
- Gomory–Hu_tree wikiPageRevisionID "576960684".
- Gomory–Hu_tree subject Category:Combinatorial_optimization.
- Gomory–Hu_tree subject Category:Graph_algorithms.
- Gomory–Hu_tree subject Category:Network_flow.
- 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 label "شجرة جوموري-هو".
- Gomory–Hu_tree sameAs Gomory%E2%80%93Hu_tree.
- Gomory–Hu_tree sameAs Q5581241.
- Gomory–Hu_tree sameAs Q5581241.
- Gomory–Hu_tree wasDerivedFrom Gomory–Hu_tree?oldid=576960684.