Open AccessLocally boundedk-colorings of trees
Author(s) -
Cédric Bentz,
Christophe Picouleau
Publication year - 2009
Publication title -
rairo - operations research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.383
H-Index - 24
eISSN - 1290-3868
pISSN - 0399-0559
DOI - 10.1051/ro/2009003
Subject(s) - combinatorics , bounded function , mathematics , tree (set theory) , discrete mathematics , mathematical analysis
Given a tree T with n vertices, we show, by using a dynamic programming approach, that the problem of nding a 3-coloring of T respecting local (i.e., associated with p prespecied subsets of vertices) color bounds can be solved in O(n6p 1 logn) time. We also show that our algorithm can be adapted to the case of k-colorings for xed k.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom