An $O(n\log ^2 n)$ Algorithm for Maximum Flow in Undirected Planar Networks (Q3680587): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0214045 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1987197912 / rank | |||
Normal rank | |||
Latest revision as of 23:50, 19 March 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
