Approximate Gomory-Hu tree is faster than \(n-1\) maximum flows (Q6593766)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximate Gomory-Hu tree is faster than \(n-1\) maximum flows |
scientific article; zbMATH DE number 7902363
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate Gomory-Hu tree is faster than \(n-1\) maximum flows |
scientific article; zbMATH DE number 7902363 |
Statements
Approximate Gomory-Hu tree is faster than \(n-1\) maximum flows (English)
0 references
27 August 2024
0 references
graph algorithm
0 references
minimum cut
0 references
Gomory-Hu tree
0 references
