A kernel for convex recoloring of weighted forests

DOI10.1007/978-3-642-11266-9_18zbMATH Open1274.68136DBLPconf/sofsem/BodlaenderC10OpenAlexW1560455338WikidataQ59567651 ScholiaQ59567651MaRDI QIDQ3401093FDOQ3401093

Authors: Marc Comas, Hans L. Bodlaender 

Publication date: 28 January 2010

Published in: SOFSEM 2010: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11266-9_18

Recommendations

• Quadratic kernelization for convex recoloring of trees
• Quadratic Kernelization for Convex Recoloring of Trees
• Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems
• A \(2^{O(k)}\)poly\((n)\) algorithm for the parameterized convex recoloring problem
• 1.5-approximation algorithm for the 2-convex recoloring problem

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)

Cited In (2)

• Quadratic kernelization for convex recoloring of trees
• Quadratic Kernelization for Convex Recoloring of Trees

This page was built for publication: A kernel for convex recoloring of weighted forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3401093)