An \(O(n\log n)\) algorithm for maximum \(st\)-flow in a directed planar graph (Q3452205)
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 6507187
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(n\log n)\) algorithm for maximum \(st\)-flow in a directed planar graph |
scientific article; zbMATH DE number 6507187 |
Statements
An <i>O</i> ( <i>n</i> log <i>n</i> ) algorithm for maximum <i>st</i> -flow in a directed planar graph (English)
0 references
11 November 2015
0 references
maximum flow
0 references
planar graphs
0 references
0.9126060605049132
0 references
0.905150294303894
0 references
0.9046477675437928
0 references
0.8804812431335449
0 references
0.8740530610084534
0 references
