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 [http://en.wikipedia.org/wiki/Gomory–Hu_tree].
-
Notifications
You must be signed in to change notification settings - Fork 3
romansalin/GomoryHu
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Gomory–Hu Tree Algorithm
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published