A faster polynomial algorithm for the constrained maximum flow problem (Q1761207)
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: A faster polynomial algorithm for the constrained maximum flow problem |
scientific article; zbMATH DE number 6106618
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A faster polynomial algorithm for the constrained maximum flow problem |
scientific article; zbMATH DE number 6106618 |
Statements
A faster polynomial algorithm for the constrained maximum flow problem (English)
0 references
15 November 2012
0 references
network flows
0 references
maximum flow
0 references
minimum cost network flow
0 references
scaling
0 references
computational complexity
0 references
0.9427446
0 references
0.9427446
0 references
0.9334884
0 references
0.9291664
0 references
0.9291664
0 references
0.9287661
0 references
0.9223027
0 references
0.9211348
0 references
