| Item type |
SIG Technical Reports(1) |
| 公開日 |
2021-04-30 |
| タイトル |
|
|
タイトル |
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes |
| タイトル |
|
|
言語 |
en |
|
タイトル |
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes |
| 言語 |
|
|
言語 |
eng |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_18gh |
|
資源タイプ |
technical report |
| 著者所属 |
|
|
|
Kyushu Institute of Technology |
| 著者所属 |
|
|
|
Tohoku University |
| 著者所属 |
|
|
|
Utrecht University |
| 著者所属(英) |
|
|
|
en |
|
|
Kyushu Institute of Technology |
| 著者所属(英) |
|
|
|
en |
|
|
Tohoku University |
| 著者所属(英) |
|
|
|
en |
|
|
Utrecht University |
| 著者名 |
Toshiki, Saitoh
Ryo, Yoshinaka
Hans, L. Bodlaender
|
| 著者名(英) |
Toshiki, Saitoh
Ryo, Yoshinaka
Hans, L. Bodlaender
|
| 論文抄録 |
|
|
内容記述タイプ |
Other |
|
内容記述 |
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. |
| 論文抄録(英) |
|
|
内容記述タイプ |
Other |
|
内容記述 |
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. |
| 書誌レコードID |
|
|
収録物識別子タイプ |
NCID |
|
収録物識別子 |
AN1009593X |
| 書誌情報 |
研究報告アルゴリズム（AL）
巻 2021-AL-183,
号 15,
p. 1-7,
発行日 2021-04-30
|
| ISSN |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
2188-8566 |
| Notice |
|
|
|
SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. |
| 出版者 |
|
|
言語 |
ja |
|
出版者 |
情報処理学会 |
IPSJ-AL21183015.pdf (715.5 kB)
