Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes

Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)


For a graph class C, the C -Edge-Deletion problem asks for a given graph G to delete the minimum number of edges from G in order to obtain a graph in C. We study the C -Edge-Deletion problem for C the class of interval graphs and other related graph classes. It follows from Courcelle’s Theorem that these problems are fixed parameter tractable when parameterized by treewidth. In this paper, we present concrete FPT algorithms for these problems. By giving explicit algorithms and analyzing these in detail, we obtain algorithms that are significantly faster than the algorithms obtained by using Courcelle’s theorem.

Original languageEnglish
Title of host publicationWALCOM
Subtitle of host publicationAlgorithms and Computation - 15th International Conference and Workshops, WALCOM 2021, Proceedings
EditorsRyuhei Uehara, Seok-Hee Hong, Subhas C. Nandy
PublisherSpringer Science and Business Media Deutschland GmbH
Number of pages12
ISBN (Print)9783030682101
Publication statusPublished - 2021
Event15th International Conference on Algorithms and Computation, WALCOM 2021 - Virtual, Online
Duration: 2021 Feb 282021 Mar 2

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12635 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference15th International Conference on Algorithms and Computation, WALCOM 2021
CityVirtual, Online


  • Edge-Deletion
  • Interval graphs
  • Parameterized algorithms
  • Treewidth

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes'. Together they form a unique fingerprint.

Cite this