Hostname: page-component-7b7567c8c-w7t8q Total loading time: 0 Render date: 2026-11-18T04:23:43.973Z Has data issue: false hasContentIssue false

Locally bounded k-colorings of trees

Published online by Cambridge University Press:  28 January 2009

C. Bentz
Affiliation:
CEDRIC, CNAM, Paris, France; cedric.bentz@cnam.fr
C. Picouleau
Affiliation:
CEDRIC, CNAM, Paris, France; chp@cnam.fr
Get access

Abstract

Given a tree T with n vertices, we show, by using a dynamicprogramming approach, that the problem of finding a 3-coloring ofT respecting local (i.e., associated with p prespecified subsetsof vertices) color bounds can be solved in O(n6p-1 logn)time. We also show that our algorithm can be adapted to the case ofk-colorings for fixed k.

Information

Type
Research Article
Copyright
© EDP Sciences, ROADEF, SMAI, 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable