An <i>O (n log n)</i> algorithm for maximum <i>st</i>-flow in a directed planar graph (Q3581580)
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 5771601
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An <i>O (n log n)</i> algorithm for maximum <i>st</i>-flow in a directed planar graph |
scientific article; zbMATH DE number 5771601 |
Statements
An <i>O (n log n)</i> algorithm for maximum <i>st</i>-flow in a directed planar graph (English)
0 references
16 August 2010
0 references
