Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems (Q5202489)
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: Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems |
scientific article; zbMATH DE number 4195680
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems |
scientific article; zbMATH DE number 4195680 |
Statements
1991
0 references
distance-directed algorithms
0 references
distance label
0 references
shortest augmenting path
0 references
layered networks
0 references
unit capacity maximum flow
0 references
parametric maximum flow
0 references
Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems (English)
0 references
0.8641451001167297
0 references
0.8449004888534546
0 references
0.8356416821479797
0 references
0.8333144783973694
0 references
