Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes
WALCOM: Algorithms and Computation - 15th International Conference and Workshops, WALCOM 2021,
Lecture Notes in Computer Science Vol.12635, pp.142-153
(2021), [peer-reviewed]
Event Date:
February 28-March 2, 2021
Abstract / 概要
For a graph class $\mathcal{C}$, the $\mathcal{C}$-Edge-Deleion problem asks for a given graph $G$ to delete the minimum number of edges from $G$ in order to obtain a graph in $\mathcal{C}$. We study the $\mathcal{C}$-Edge-Deletion problem for $\mathcal{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.