A strongly polynomial algorithm for the minimum maximum flow degree problem (Q6161285)
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 7702777
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A strongly polynomial algorithm for the minimum maximum flow degree problem |
scientific article; zbMATH DE number 7702777 |
Statements
A strongly polynomial algorithm for the minimum maximum flow degree problem (English)
0 references
27 June 2023
0 references
minimum maximum flow degree problem
0 references
flow coloring problem
0 references
linear programming
0 references
network flow
0 references
0.8425837755203247
0 references
0.8155556321144104
0 references
0.8132142424583435
0 references
0.8098515868186951
0 references
