Algorithms for bandwidth consecutive multicolorings of graphs (extended abstract) (Q2897987)
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 6057327
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for bandwidth consecutive multicolorings of graphs (extended abstract) |
scientific article; zbMATH DE number 6057327 |
Statements
Algorithms for Bandwidth Consecutive Multicolorings of Graphs (English)
0 references
16 July 2012
0 references
bandwidth coloring
0 references
channel assignment
0 references
multicoloring
0 references
series-parallel graph
0 references
partial \(k\)-tree
0 references
algorithm
0 references
acyclic orientation
0 references
approximation
0 references
FPTAS
0 references
0.9796530604362488
0 references
0.9252834916114808
0 references
0.9173151254653932
0 references
0.8266430497169495
0 references
