Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs

Let G be a graph in which each vertex v has a positive integer weight b(v) and each edge (v,w) has a nonnegative integer weight b(v,w). A bandwidth consecutive multicoloring, simply called a b-coloring of G, assigns each vertex v a specified number b(v) of consecutive positive integers as colors of...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 607; s. 208 - 220
Hlavní autori:	Obata, Yuji, Nishizeki, Takao
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 23.11.2015
Predmet:	Algorithms Approximation Approximation algorithm Bandwidth Bandwidth consecutive multicoloring Coloring Graph coloring Graph theory Graphs Integers Mathematical analysis Bandwidth consecutive multicoloring Approximation algorithm Graph coloring
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!