An <i>O</i> ( <i>n</i> log <i>n</i> ) algorithm for maximum <i>st</i> -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 this page instead for the normal view: An O ( n log n ) algorithm for maximum st -flow in a directed planar graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An <i>O</i> ( <i>n</i> log <i>n</i> ) algorithm for maximum <i>st</i> -flow in a directed planar graph |
scientific article |
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
