Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs (Q897950)
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: Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs |
scientific article; zbMATH DE number 6517479
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs |
scientific article; zbMATH DE number 6517479 |
Statements
Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs (English)
0 references
8 December 2015
0 references
graph coloring
0 references
bandwidth consecutive multicoloring
0 references
approximation algorithm
0 references
0.97106063
0 references
0.9670404
0 references
0.92395145
0 references
0.89993125
0 references
0.89942765
0 references
0 references
0.8916403
0 references
0.8916403
0 references
