Kernelization through Tidying

DOI10.1007/978-3-642-12200-2_46MaRDI QIDQ3557047zbMATH OpenOpenAlexFDO

Authors René van Bevern, Hannes Moser, Rolf Niedermeier

Publication date 27 April 2010

Published in LATIN 2010: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-12200-2_46

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) Nonnumerical algorithms (68W05)

Recommendations

• Approximation and tidying -- a problem kernel for s-plex cluster vertex deletion
• Kernel for \(K_t\)\textsc-free Edge Deletion
• A tight approximation algorithm for the cluster vertex deletion problem
• A tight approximation algorithm for the cluster vertex deletion problem
• Cluster vertex deletion: a parameterization between vertex cover and clique-width
• Fixed-parameter algorithms for cluster vertex deletion
• Fixed-Parameter Algorithms for Cluster Vertex Deletion
• Approximation and kernelization for chordal vertex deletion
• Approximation and kernelization for chordal vertex deletion
• An improved parameterized algorithm for the p-cluster vertex deletion problem

Cited in

(2)

• Approximation and tidying -- a problem kernel for s-plex cluster vertex deletion
• A more relaxed model for graph-based data clustering: s-plex cluster editing

This page was built for publication: Kernelization through Tidying

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