| Issue |
RAIRO-Oper. Res.
Volume 43, Number 1, January-March 2009
|
|
|---|---|---|
| Page(s) | 27 - 33 | |
| DOI | https://doi.org/10.1051/ro/2009003 | |
| Published online | 28 January 2009 | |
Locally bounded k-colorings of trees
1
CEDRIC, CNAM,
Paris, France; cedric.bentz@cnam.fr
2
CEDRIC, CNAM,
Paris, France; chp@cnam.fr
Received:
19
June
2007
Accepted:
28
July
2008
Given a tree T with n vertices, we show, by using a dynamic programming approach, that the problem of finding a 3-coloring of T respecting local (i.e., associated with p prespecified subsets of vertices) color bounds can be solved in O(n6p-1logn) time. We also show that our algorithm can be adapted to the case of k-colorings for fixed k.
Mathematics Subject Classification: 05C15 / 90C39
Key words: Bounded graph coloring / tree / dynamic programming.
© EDP Sciences, ROADEF, SMAI, 2009
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.