An <i>O (n log n)</i> algorithm for maximum <i>st</i>-flow in a directed planar graph (Q3581580): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/1109557.1109615 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4252072354 / rank | |||
Normal rank | |||
Latest revision as of 21:58, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An <i>O (n log n)</i> algorithm for maximum <i>st</i>-flow in a directed planar graph |
scientific article |
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
