Bottleneck flows in unit capacity networks (Q976109)
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: Bottleneck flows in unit capacity networks |
scientific article; zbMATH DE number 5721997
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bottleneck flows in unit capacity networks |
scientific article; zbMATH DE number 5721997 |
Statements
Bottleneck flows in unit capacity networks (English)
0 references
16 June 2010
0 references
algorithms
0 references
combinatorial problems
0 references
graphs
0 references
network flows
0 references
minimum cost flow
0 references
unit capacity
0 references
0 references
0 references
0 references
0 references
0 references
0.89876056
0 references
0.89074004
0 references
0.8881549
0 references
0.8880575
0 references
