Quadratic kernelization for convex recoloring of trees

DOI10.1007/s00453-010-9404-2zbMath1234.68146WikidataQ57198691 ScholiaQ57198691MaRDI QIDQ639283

Michael R. Fellows, Hans L. Bodlaender, Frances A. Rosamond, Michael A. Langston, Mark A. Ragan, Mark Weyer

Publication date: 20 September 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-010-9404-2

zbMATH Keywords

fixed parameter tractability; trees; phylogeny; combinatorial algorithms; kernelization; convex recoloring

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C15: Coloring of graphs and hypergraphs

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)