Fast FPT-Algorithms for Cleaning Grids

DOI10.1007/11672142_29MaRDI QIDQ5449813zbMATH OpenOpenAlexFDO

Authors Dimitrios M. Thilikos, J. Díaz

Publication date 19 March 2008

Published in STACS 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11672142_29

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A 2k kernel for the cluster editing problem
• A \(2k\) kernel for the cluster editing problem
• Efficient Parameterized Preprocessing for Cluster Editing
• Cograph editing: complexity and parameterized algorithms
• A more effective linear kernelization for cluster editing

Cited in

(9)

• Parameterized complexity of finding regular induced subgraphs
• Two edge modification problems without polynomial kernels
• Cleaning interval graphs
• Approximation and tidying -- a problem kernel for s-plex cluster vertex deletion
• Parameterized complexity of Eulerian deletion problems
• Parameterized complexity of Eulerian deletion problems
• Two edge modification problems without polynomial kernels
• Parameterized Graph Cleaning Problems
• Parameterized graph cleaning problems

This page was built for publication: Fast FPT-Algorithms for Cleaning Grids

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