All-pairs minimum cuts in near-linear time for surface-embedded graphs (Q3132856)
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: All-pairs minimum cuts in near-linear time for surface-embedded graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8659197092056274
0 references
0.8604445457458496
0 references
0.8474950790405273
0 references
0.8326521515846252
0 references
0.7967812418937683
0 references
