Faster algorithms for cograph edge modification problems

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


In the COGRAPH DELETION (resp., COGRAPH EDITING) problem the input is a graph G and an integer k, and the goal is to decide whether there is a set of edges of size at most k whose removal from G (resp., removal and addition to G) results in a graph that does not contain an induced path with four vertices. In this paper we give algorithms for COGRAPH DELETION and COGRAPH EDITING whose running times are O(2.303k) and O(4.329k), respectively.

Original languageEnglish
Article number105946
JournalInformation Processing Letters
StatePublished - 1 Jun 2020


  • Branching algorithms
  • Graph algorithms
  • Parameterized complexity

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'Faster algorithms for cograph edge modification problems'. Together they form a unique fingerprint.

Cite this