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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationComputational Intelligence in Information Systems - Proceedings of the Computational Intelligence in Information Systems Conference, CIIS 2016
EditorsSomnuk Phon-Amnuaisuk, Thien-Wan Au, Saiful Omar
PublisherSpringer Verlag
Pages294-305
Number of pages12
ISBN (Print)9783319485164
DOIs
Publication statusPublished - 2017
EventInternational Conference on Computational Intelligence in Information Systems, CIIS 2016 - Gadong, Brunei Darussalam
Duration: 2016 Nov 182016 Nov 20

Publication series

NameAdvances in Intelligent Systems and Computing
Volume532
ISSN (Print)2194-5357

Other

OtherInternational Conference on Computational Intelligence in Information Systems, CIIS 2016
Country/TerritoryBrunei Darussalam
CityGadong
Period16/11/1816/11/20

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Solving the longest oneway-ticket problem and enumerating letter graphs by augmenting the two representative approaches with ZDDs'. Together they form a unique fingerprint.

Cite this