An $O(n\log ^2 n)$ Algorithm for Maximum Flow in Undirected Planar Networks (Q3680587): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:43, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An $O(n\log ^2 n)$ Algorithm for Maximum Flow in Undirected Planar Networks |
scientific article |
Statements
An $O(n\log ^2 n)$ Algorithm for Maximum Flow in Undirected Planar Networks (English)
0 references
1985
0 references
duality
0 references
graph algorithm
0 references
maximum flow
0 references
undirected planar flow network
0 references
