Finding a path in group-labeled graphs with two labels forbidden

Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi

研究成果: 書籍/レポート タイプへの寄稿会議への寄与

3 被引用数 (Scopus)

抄録

The parity of the length of paths and cycles is a classical and well-studied topic in graph theory and theoretical computer science. The parity constraints can be extended to the label constraints in a group-labeled graph, which is a directed graph with a group label on each arc. Recently, paths and cycles in group-labeled graphs have been investigated, such as finding non-zero disjoint paths and cycles. In this paper, we present a solution to finding an s–t path in a grouplabeled graph with two labels forbidden. This also leads to an elementary solution to finding a zero path in a Z3-labeled graph, which is the first nontrivial case of finding a zero path. This situation in fact generalizes the 2-disjoint paths problem in undirected graphs, which also motivates us to consider that setting. More precisely, we provide a polynomial-time algorithm for testing whether there are at most two possible labels of s–t paths in a group-labeled graph or not, and finding s–t paths attaining at least three distinct labels if exist. We also give a necessary and sufficient condition for a group-labeled graph to have exactly two possible labels of s–t paths, and our algorithm is based on this characterization.

本文言語英語
ホスト出版物のタイトルAutomata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Proceedings
編集者Magnus M. Halldorsson, Naoki Kobayashi, Bettina Speckmann, Kazuo Iwama
出版社Springer Verlag
ページ797-809
ページ数13
ISBN(印刷版)9783662476710
DOI
出版ステータス出版済み - 2015
外部発表はい
イベント42nd International Colloquium on Automata, Languages and Programming, ICALP 2015 - Kyoto, 日本
継続期間: 7月 6 20157月 10 2015

出版物シリーズ

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

会議

会議42nd International Colloquium on Automata, Languages and Programming, ICALP 2015
国/地域日本
CityKyoto
Period7/6/157/10/15

!!!All Science Journal Classification (ASJC) codes

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

フィンガープリント

「Finding a path in group-labeled graphs with two labels forbidden」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル