Approximate Gomory–Hu tree is faster than <i>n</i> – 1 max-flows (Q6065289)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7765283
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate Gomory–Hu tree is faster than <i>n</i> – 1 max-flows |
scientific article; zbMATH DE number 7765283 |
Statements
Approximate Gomory–Hu tree is faster than <i>n</i> – 1 max-flows (English)
0 references
14 November 2023
0 references
Gomory-Hu tree
0 references
graph algorithm
0 references
graph connectivity
0 references
