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

Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender

研究成果: Conference contribution

1 被引用数 (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.

本文言語English
ホスト出版物のタイトルWALCOM
ホスト出版物のサブタイトルAlgorithms and Computation - 15th International Conference and Workshops, WALCOM 2021, Proceedings
編集者Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy
出版社Springer Science and Business Media Deutschland GmbH
ページ142-153
ページ数12
ISBN(印刷版)9783030682101
DOI
出版ステータスPublished - 2021
イベント15th International Conference on Algorithms and Computation, WALCOM 2021 - Virtual, Online
継続期間: 2021 2 282021 3 2

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
12635 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Conference

Conference15th International Conference on Algorithms and Computation, WALCOM 2021
CityVirtual, Online
Period21/2/2821/3/2

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル