Minimum cost flows in graphs with unit capacities (Q2955012)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6677411
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum cost flows in graphs with unit capacities |
scientific article; zbMATH DE number 6677411 |
Statements
24 January 2017
0 references
minimum cost flow
0 references
bipartite matching
0 references
unit capacity
0 references
cost scaling
0 references
0.9566777348518372
0 references
0.8050680160522461
0 references
0.800535261631012
0 references
0.7993896007537842
0 references
0.7960196137428284
0 references
