Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs (Q5495844)
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: Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs |
scientific article; zbMATH DE number 6327008
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs |
scientific article; zbMATH DE number 6327008 |
Statements
Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs (English)
0 references
7 August 2014
0 references
combinatorial optimization
0 references
max flow
0 references
Menger problem
0 references
multiple-source shortest paths
0 references
planar graphs
0 references
0.9450518
0 references
0.92332554
0 references
0.9178834
0 references
0.91727424
0 references
0.9074236
0 references
0.90721107
0 references
0.90008295
0 references
