# Solving the Longest Oneway-Ticket Problem and Enumerating Letter Graphs by Augmenting the Two Representative Approaches with ZDDs

## 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 frontier-based 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.

## Keywords

Railway Network Enumeration Algorithm Degree Function Cycle Graph Integer Programming Approach## References

- 1.Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput.
**C–35**(8), 677–691 (1986)CrossRefzbMATHGoogle Scholar - 2.Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)zbMATHGoogle Scholar
- 3.Inoue, T., Takano, K., Watanabe, T., Kawahara, J., Yoshinaka, R., Kishimoto, A., Tsuda, K., Minato, S., Hayashi, Y.: Distribution loss minimization with guaranteed error bound. IEEE Trans. Smart Grid
**5**(1), 102–111 (2014)CrossRefGoogle Scholar - 4.Iwashita, H., Minato, S.: Efficient top-down ZDD construction techniques using recursive specifications. Hokkaido University, Division of Computer Science, TCS Technical reports TCS-TR-A-13-69 (2013)Google Scholar
- 5.Kawahara, J., Inoue, T., Iwashita, H., Minato, S.: Frontier-based search for enumerating all constrained subgraphs with compressed representation. Hokkaido University, Division of Computer Science, TCS Technical reports TCS-TR-A-14-76 (2014)Google Scholar
- 6.Knuth, D.E.: The Art of Computer Programming. Combinatorial Algorithms, Part 1, vol. 4A. Addison-Wesley, Upper Saddle River (2011)Google Scholar
- 7.López, R.: How does a topologist classify the letters of the alphabet? CoRR abs/1410.3364 (2014). http://arXiv.org/abs/1410.3364
- 8.Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: The 30th ACM/IEEE Design Automation Conference, pp. 272–277 (1993)Google Scholar
- 9.Minato, S.: Zero-suppressed BDDs and their applications. Int. J. Softw. Tools Technol. Transfer
**3**(2), 156–170 (2001)zbMATHGoogle Scholar - 10.Miyashiro, R., Kasai, T., Matsui, T.: Saicho katamichi kippu no genmitsukai wo motomeru (Strictly solving the longest oneway-ticket problem) (in Japanese). In: Proceedings of the 2000 Fall National Conference of Operations Research Society of Japan, pp. 24–25 (2000)Google Scholar
- 11.Sekine, K., Imai, H., Tani, S.: Computing the Tutte polynomial of a graph of moderate size. In: Proceedings of the 6th International Symposium on Algorithms and Computation (ISAAC), pp. 224–233 (1995)Google Scholar
- 12.Takizawa, A., Takechi, Y., Ohta, A., Katoh, N., Inoue, T., Horiyama, T., Kawahara, J., Minato, S.: Enumeration of region partitioning for evacuation planning based on ZDD. In: Proceedings of 11th International Symposium on Operations Research and its Applications in Engineering, Technology and Management 2013 (ISORA 2013), pp. 1–8 (2013)Google Scholar
- 13.Yoshinaka, R., Saitoh, T., Kawahara, J., Tsuruma, K., Iwashita, H., Minato, S.: Finding all solutions and instances of numberlink and slitherlink by ZDDs. Algorithms
**5**(2), 176–213 (2012). http://dx.doi.org/10.3390/a5020176 MathSciNetCrossRefGoogle Scholar