Using the minimum maximum flow degree to approximate the flow coloring problem (Q2675725)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using the minimum maximum flow degree to approximate the flow coloring problem |
scientific article |
Statements
Using the minimum maximum flow degree to approximate the flow coloring problem (English)
0 references
26 September 2022
0 references
graph algorithms
0 references
network flow
0 references
flow degree
0 references
flow coloring problem
0 references
approximation algorithm
0 references
