New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs (Q5146764)
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 7304027
| 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 7304027 |
Statements
New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs (English)
0 references
2 February 2021
0 references
0.996228814125061
0 references
0.8741369247436523
0 references
0.8255845904350281
0 references
