All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs (Q3132856)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs |
scientific article |
Statements
30 January 2018
0 references
minimum cuts
0 references
surface-embedded graphs
0 references
Gomory-Hu tree
0 references
All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs (English)
0 references
