An $O(n\log ^2 n)$ Algorithm for Maximum Flow in Undirected Planar Networks (Q3680587)
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: An O(n\log ^2 n) Algorithm for Maximum Flow in Undirected Planar Networks |
scientific article; zbMATH DE number 3902367
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An $O(n\log ^2 n)$ Algorithm for Maximum Flow in Undirected Planar Networks |
scientific article; zbMATH DE number 3902367 |
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
0.9181174039840698
0 references
0.9173554182052612
0 references
0.9126060605049132
0 references
0.8879922032356262
0 references
0.8834864497184753
0 references
