,
Francis Sarrazin
Creative Commons Attribution 4.0 International license
We study the parameterized complexity of the Cograph Deletion problem, which asks whether at most k edges can be deleted from a graph to make it P₄-free. This is a well-known graph modification problem with applications in computational biology and social network analysis. Most parameterized algorithms use a similar strategy: identify an induced P₄ and branch on its local structure. The current best algorithm achieves running time O^*(2.303^k), but relies on a large number of intricate branching cases found by automated search, making further improvements along this line difficult. We therefore introduce a new approach based on modular decompositions. We solve each module and the quotient graph independently, with the latter being the core problem. This reduces the problem to solving on a prime graph, in which all modules are trivial. We then use a characterization of Chudnovsky et al. stating that any large enough prime graph has one of seven structures as an induced subgraph. These all have linearly many P₄s, which we use in a recursive branch tree algorithm to achieve running time O^*((2 + ε)^k) for any ε > 0. Although the hidden polynomial factors can be very large, our result shows that the exponential base of the complexity can be made arbitrarily close to 2, suggesting a new direction for improving graph modification algorithms. More broadly, this appears to be the first algorithmic application of the prime graph characterization. To support further future applications, we characterize the graph classes ℋ for which the ℋ-free editing problem admits a similar reduction to prime graphs.
@InProceedings{lafond_et_al:LIPIcs.IPEC.2026.11,
author = {Lafond, Manuel and Sarrazin, Francis},
title = {{An O^*((2+\epsilon)^k) Time Algorithm for Cograph Deletion Using Unavoidable Subgraphs in Large Prime Graphs}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {11:1--11:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-456-7},
ISSN = {1868-8969},
year = {2026},
volume = {398},
editor = {Korhonen, Tuukka and Lampis, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2026.11},
URN = {urn:nbn:de:0030-drops-281847},
doi = {10.4230/LIPIcs.IPEC.2026.11},
annote = {Keywords: Cographs, Parameterized complexity, Graph editing, Branching algorithms, Prime graphs}
}