Convex recolorings of strings and trees: definitions, hardness results and algorithms
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Connected coloring completion for general graphs: algorithms and complexity
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Quadratic kernelization for convex recoloring of trees
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Convex Recoloring Revisited: Complexity and Exact Algorithms
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
A Kernel for Convex Recoloring of Weighted Forests
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Speeding up dynamic programming for some NP-hard graph recoloring problems
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Partial convex recolorings of trees and galled networks: Tight upper and lower bounds
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.89 |
In this paper we present a parameterized algorithm that solves the Convex Recoloring problem for trees in O(256^k*poly(n)). This improves the currently best upper bound of O(k(k/log k)^k*poly(n)) achieved by Moran and Snir.