Article contents
Locally bounded k-colorings of trees
Published online by Cambridge University Press: 28 January 2009
Abstract
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.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, ROADEF, SMAI, 2009
References
- 3
- Cited by