A 2O (k) poly (n) algorithm for the parameterized Convex Recoloring problem

Information Processing Letters

Volumn 104, Issue 2, 2007, Pages 53-58

  Razgon, Igor ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

Convex recoloring; Graph algorithms; Parameterized complexity

Indexed keywords

CONVEX RECOLORING; GRAPH ALGORITHMS; PARAMETERIZED COMPLEXITY;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING;

TREES (MATHEMATICS);

EID: 34447645284     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.05.007     Document Type: Article

References (5)

1. E. Bachoore, H. Bodlaender, Convex recoloring of leaf-colored trees, Technical Report UU-CS-2006-10, Department of Information and Computing Sciences, Utrecht University, 2006
2. H. Bodlaender, M. Fellows, M. Langston, M. Ragan, F. Rosamond, M. Weyer, Quadratic kernelization for convex recoloring, in: COCOON 2007, in press
3. H. Bodlaender, M. Fellows, M. Langston, M. Ragan, F. Rosamond, M. Weyer, Kernelization for convex recoloring, in: ACID 2006, King's College London, pp. 23-35
4. B. Chor, M. Fellows, M. Ragan, F. Rosamond, S. Snir, I. Razgon, Connected coloring completion for general graphs: Algorithms and complexity, in: COCOON 2007, in press
5. S. Moran, S. Snir, Convex recolorings of strings and trees: Definitions, hardness results and algorithms, in: WADS 2005, Springer-Verlag, pp. 218-232