| Item type |
SIG Technical Reports(1) |
| 公開日 |
2023-11-09 |
| タイトル |
|
|
タイトル |
On the Problems of Finding Paths to Avoid Ordered Forbidden Transitions Based on Graph Structure |
| タイトル |
|
|
言語 |
en |
|
タイトル |
On the Problems of Finding Paths to Avoid Ordered Forbidden Transitions Based on Graph Structure |
| 言語 |
|
|
言語 |
eng |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_18gh |
|
資源タイプ |
technical report |
| 著者所属 |
|
|
|
Graduate School of Information Sciences, Tohoku University |
| 著者所属 |
|
|
|
Graduate School of Information Sciences, Tohoku University |
| 著者所属 |
|
|
|
Graduate School of Information Sciences, Tohoku University |
| 著者所属 |
|
|
|
Graduate School of Information Sciences, Tohoku University |
| 著者所属(英) |
|
|
|
en |
|
|
Graduate School of Information Sciences, Tohoku University |
| 著者所属(英) |
|
|
|
en |
|
|
Graduate School of Information Sciences, Tohoku University |
| 著者所属(英) |
|
|
|
en |
|
|
Graduate School of Information Sciences, Tohoku University |
| 著者所属(英) |
|
|
|
en |
|
|
Graduate School of Information Sciences, Tohoku University |
| 著者名 |
Kota, Kumakura
Akira, Suzuki
Yuma, Tamura
Xiao, Zhou
|
| 著者名(英) |
Kota, Kumakura
Akira, Suzuki
Yuma, Tamura
Xiao, Zhou
|
| 論文抄録 |
|
|
内容記述タイプ |
Other |
|
内容記述 |
Finding a path between two vertices of a given graph is one of the most classic problems in graph theory. Recently, problems of finding a route avoiding forbidden transitions, that is, two edges that cannot be passed through consecutively, have been studied. In this paper, we introduce the ordered variants of these problems, namely the Path Avoiding Ordered Forbidden Transitions problem (PAOFT for short) and the Trail Avoiding Ordered Forbidden Transitions problem (TAOFT for short). We show that both the problems are NP-complete even for bipartite planar graphs with maximum degree three. Furthermore, we show that TAOFT remains NP-complete for cactus graphs. As positive results of PAOFT, we give a polynomial-time algorithm for bounded treewidth graphs and a linear-time algorithm for cactus graphs. |
| 論文抄録(英) |
|
|
内容記述タイプ |
Other |
|
内容記述 |
Finding a path between two vertices of a given graph is one of the most classic problems in graph theory. Recently, problems of finding a route avoiding forbidden transitions, that is, two edges that cannot be passed through consecutively, have been studied. In this paper, we introduce the ordered variants of these problems, namely the Path Avoiding Ordered Forbidden Transitions problem (PAOFT for short) and the Trail Avoiding Ordered Forbidden Transitions problem (TAOFT for short). We show that both the problems are NP-complete even for bipartite planar graphs with maximum degree three. Furthermore, we show that TAOFT remains NP-complete for cactus graphs. As positive results of PAOFT, we give a polynomial-time algorithm for bounded treewidth graphs and a linear-time algorithm for cactus graphs. |
| 書誌レコードID |
|
|
収録物識別子タイプ |
NCID |
|
収録物識別子 |
AN1009593X |
| 書誌情報 |
研究報告アルゴリズム（AL）
巻 2023-AL-195,
号 24,
p. 1-5,
発行日 2023-11-09
|
| ISSN |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
2188-8566 |
| Notice |
|
|
|
SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. |
| 出版者 |
|
|
言語 |
ja |
|
出版者 |
情報処理学会 |
IPSJ-AL23195024.pdf (1.1 MB)
