On the complexity of the flow coloring problem (Q499367)
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: On the complexity of the flow coloring problem |
scientific article; zbMATH DE number 6487401
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the flow coloring problem |
scientific article; zbMATH DE number 6487401 |
Statements
On the complexity of the flow coloring problem (English)
0 references
30 September 2015
0 references
round weighting problem
0 references
flow coloring
0 references
bipartite graphs
0 references
NP-hardness
0 references
inapproximability
0 references
0.90917295
0 references
0.9075459
0 references
0.9054258
0 references
0.9054258
0 references
0.89233255
0 references
0 references
0.8904605
0 references
