License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2022.68
URN: urn:nbn:de:0030-drops-168663
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/16866/
Le, Hoang-Oanh ;
Le, Van Bang
Complexity of the Cluster Vertex Deletion Problem on H-Free Graphs
Abstract
The well-known Cluster Vertex Deletion problem (cluster-vd) asks for a given graph G and an integer k whether it is possible to delete at most k vertices of G such that the resulting graph is a cluster graph (a disjoint union of cliques). We give a complete characterization of graphs H for which cluster-vd on H-free graphs is polynomially solvable and for which it is NP-complete.
BibTeX - Entry
@InProceedings{le_et_al:LIPIcs.MFCS.2022.68,
author = {Le, Hoang-Oanh and Le, Van Bang},
title = {{Complexity of the Cluster Vertex Deletion Problem on H-Free Graphs}},
booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)},
pages = {68:1--68:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-256-3},
ISSN = {1868-8969},
year = {2022},
volume = {241},
editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16866},
URN = {urn:nbn:de:0030-drops-168663},
doi = {10.4230/LIPIcs.MFCS.2022.68},
annote = {Keywords: Cluster vertex deletion, Vertex cover, Computational complexity, Complexity dichotomy}
}
|
Keywords: |
|
Cluster vertex deletion, Vertex cover, Computational complexity, Complexity dichotomy |
|
Collection: |
|
47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022) |
|
Issue Date: |
|
2022 |
|
Date of publication: |
|
22.08.2022 |
