On the Clique Editing Problem

DOI10.1007/978-3-662-44465-8_40zbMath1426.68220OpenAlexW568002616MaRDI QIDQ2922634

Ivana Selečéniová, Ivan Kováč, 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

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

Related Items (4)

Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes ⋮ Parameterized algorithms for min-max 2-cluster editing ⋮ A survey of parameterized algorithms and the complexity of edge modification ⋮ Complexity of the cluster deletion problem on subclasses of chordal graphs

This page was built for publication: On the Clique Editing Problem