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...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 607; pp. 208 - 220
Main Authors:	Obata, Yuji, Nishizeki, Takao
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 23.11.2015
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!