Solving the longest oneway-ticket problem and enumerating letter graphs by augmenting the two representative approaches with ZDDs

Jun Kawahara, Toshiki Saitoh, Hirofumi Suzuki, Ryo Yoshinaka

研究成果: Conference contribution

5 被引用数 (Scopus)

抄録

Several researchers have studied subgraph enumeration algorithms that use a compressed expression for a family of sets, called a zero-suppressed binary decision diagram (ZDD), to solve subgraph optimization problems. We have two representative approaches to manipulate ZDDs effectively. One is fundamental mathematical operations on families of sets over ZDDs. The other is a direct construction method of a ZDD that represents desired subgraphs of a graph and is called frontierbased search. In this research, we augment the approaches by proposing two new operations, called disjoint join and joint join, on family algebra over ZDDs and extending the frontier-based search to enumerate subgraphs that have a given number of vertices of specified degrees. Employing the new approaches, we present enumeration algorithms for alphabet letter graphs on a given graph. Moreover, we solve a variant of the longest path problem, called the Longest Oneway-ticket Problem (LOP), that requires computing the longest trip on the railway network of the Japan Railways Group using a oneway ticket. Numerical experiments show that our algorithm solves the LOP and is faster than the existing integer programming approach for some instances.

本文言語English
ホスト出版物のタイトルComputational Intelligence in Information Systems - Proceedings of the Computational Intelligence in Information Systems Conference, CIIS 2016
編集者Somnuk Phon-Amnuaisuk, Thien-Wan Au, Saiful Omar
出版社Springer Verlag
ページ294-305
ページ数12
ISBN(印刷版)9783319485164
DOI
出版ステータスPublished - 2017
イベントInternational Conference on Computational Intelligence in Information Systems, CIIS 2016 - Gadong, Brunei Darussalam
継続期間: 2016 11 182016 11 20

出版物シリーズ

名前Advances in Intelligent Systems and Computing
532
ISSN(印刷版)2194-5357

Other

OtherInternational Conference on Computational Intelligence in Information Systems, CIIS 2016
国/地域Brunei Darussalam
CityGadong
Period16/11/1816/11/20

ASJC Scopus subject areas

  • 制御およびシステム工学
  • コンピュータ サイエンス(全般)

フィンガープリント

「Solving the longest oneway-ticket problem and enumerating letter graphs by augmenting the two representative approaches with ZDDs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル