Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs (Q3559384)
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 5707365
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs |
scientific article; zbMATH DE number 5707365 |
Statements
Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs (English)
0 references
14 May 2010
0 references
cost coloring
0 references
dynamic programming
0 references
list coloring
0 references
NP-completeness
0 references
polynomial-time algorithm
0 references
0.9399694
0 references
0.9153396
0 references
0.9153396
0 references
0.90371424
0 references
0.90322936
0 references
0.8967805
0 references
0.88972855
0 references
0 references
