Algorithms for deletion problems on split graphs

Research output: Contribution to journalArticlepeer-review


In the SPLIT TO BLOCK VERTEX DELETION and SPLIT TO THRESHOLD VERTEX DELETION problems the input is a split graph G and an integer k, and the goal is to decide whether there is a set S of vertices of size at most k such that G−S is a block graph and G−S is a threshold graph, respectively. In this paper we give algorithms for these problems whose running times are O(2.076k) and O(1.619k), respectively.

Original languageEnglish
Article number106066
JournalInformation Processing Letters
StatePublished - 1 Apr 2021


  • Graph algorithms
  • Parameterized complexity
  • Split graphs

ASJC Scopus subject areas

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


Dive into the research topics of 'Algorithms for deletion problems on split graphs'. Together they form a unique fingerprint.

Cite this