New algorithms and lower bounds for all-pairs max-flow in undirected graphs (Q5158499)
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 7413500
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New algorithms and lower bounds for all-pairs max-flow in undirected graphs |
scientific article; zbMATH DE number 7413500 |
Statements
25 October 2021
0 references
Gomory-Hu
0 references
conditional lower bounds
0 references
max-flow
0 references
0 references
0 references
0.996228814125061
0 references
0.8757956027984619
0 references
0.8198032379150391
0 references
