A strongly polynomial algorithm for the minimum maximum flow degree problem (Q6161285): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3056948 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the complexity of the flow coloring problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An application of simultaneous diophantine approximation in combinatorial optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the complexity of bandwidth allocation in radio networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4254875 / rank | |||
Normal rank | |||
Revision as of 13:13, 1 August 2024
scientific article; zbMATH DE number 7702777
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
