| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429207 | Information Processing Letters | 2007 | 6 Pages |
Abstract
In this paper we present a parameterized algorithm that solves the Convex Recoloring problem for trees in O(k256∗poly(n)). This improves the currently best upper bound of O(kk(k/log k)∗poly(n)) achieved by Moran and Snir.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
