Kernelization and parameterized complexity of star editing and union editing

DOI10.1007/978-3-642-35261-4_16MaRDI QIDQ4909529zbMATH OpenOpenAlexFDO

Authors Jiong Guo, Yash Raj Shrestha

Publication date 21 March 2013

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-35261-4_16

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover
• Parameterized Reductions and Algorithms for Another Vertex Cover Generalization
• A \(2k\) kernel for the cluster editing problem
• A 2k kernel for the cluster editing problem
• A More Effective Linear Kernelization for Cluster Editing

Cited in

(1)

• Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover

This page was built for publication: Kernelization and parameterized complexity of star editing and union editing

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