Quadratic Kernelization for Convex Recoloring of Trees
From MaRDI portal
Publication:3608834
DOI10.1007/978-3-540-73545-8_11zbMath1206.68141OpenAlexW2561728979MaRDI QIDQ3608834
Mark A. Ragan, Michael A. Langston, Frances A. Rosamond, Michael R. Fellows, Mark Weyer, Hans L. Bodlaender
Publication date: 6 March 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73545-8_11
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Problems related to evolution (92D15) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
A \(2^{O(k)}\)poly\((n)\) algorithm for the parameterized convex recoloring problem ⋮ The balanced connected subgraph problem for geometric intersection graphs ⋮ Convex Recoloring Revisited: Complexity and Exact Algorithms ⋮ Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems ⋮ On the complexity of some colorful problems parameterized by treewidth ⋮ Quadratic kernelization for convex recoloring of trees ⋮ Upper and lower bounds for finding connected motifs in vertex-colored graphs ⋮ Kernelization: New Upper and Lower Bound Techniques
This page was built for publication: Quadratic Kernelization for Convex Recoloring of Trees
