A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\) (Q2175244)
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: A note on polynomial algorithm for cost coloring of bipartite graphs with 4 |
scientific article; zbMATH DE number 7194428
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\) |
scientific article; zbMATH DE number 7194428 |
Statements
A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\) (English)
0 references
28 April 2020
0 references
bipartite graph
0 references
chromatic sum
0 references
cost coloring
0 references
NP-completeness
0 references
polynomial algorithm
0 references
0.7990188598632812
0 references
0.797127366065979
0 references
0.7838307619094849
0 references
0.7811349034309387
0 references
