An $o(n^3 )$-Time Maximum-Flow Algorithm (Q5691288): Difference between revisions
From MaRDI portal
Created a new Item |
Removed claim: author (P16): Item:Q294661 |
||
| Property / author | |||
| Property / author: Joseph Cheriyan / rank | |||
Revision as of 12:52, 12 February 2024
scientific article; zbMATH DE number 971579
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An $o(n^3 )$-Time Maximum-Flow Algorithm |
scientific article; zbMATH DE number 971579 |
Statements
An $o(n^3 )$-Time Maximum-Flow Algorithm (English)
0 references
9 June 1997
0 references
network flow
0 references
graph algorithm
0 references
preflow-push algorithm
0 references
