On the clique editing problem

DOI10.1007/978-3-662-44465-8_40MaRDI QIDQ2922634zbMATH OpenOpenAlexFDO

Authors Ivan Kováč, Ivana Selečéniová, Monika Steinová

Publication date 14 October 2014

Published in Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-44465-8_40

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Analysis of algorithms (68W40)

Recommendations

• A PTAS for the Cluster Editing Problem on Planar Graphs
• Editing the simplest graphs
• Cluster graph modification problems
• scientific article; zbMATH DE number 1953109
• Cluster editing with locally bounded modifications

Cited in

(11)

• Parameterized algorithms for min-max 2-cluster editing
• On Editing Graphs into 2-Club Clusters
• Editing simple graphs
• A PTAS for the Cluster Editing Problem on Planar Graphs
• Editing graphs into few cliques: complexity, approximation, and kernelization schemes
• Approximating Clique and Biclique Problems
• Complexity of the cluster deletion problem on subclasses of chordal graphs
• Editing the simplest graphs
• \((1,1)\)-cluster editing is polynomial-time solvable
• A survey of parameterized algorithms and the complexity of edge modification
• Complexity and parameterized algorithms for cograph editing

This page was built for publication: On the clique editing problem

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