In conclusion, the remove-restrict-k and dist algo-
rithms in the vertex variable seem to be the best for
the shortest s-t path reconﬁguration problem.
Table 3: Results for the polynomial time algorithm for pla-
nar graphs.
Instance Time (sec.)
grid20x20 < 0.1
grid40x40 < 0.1
grid60x60 0.1
grid80x80 0.3
grid100x100 0.7
5 CONCLUSION
In this paper, we have proposed several algorithms for
the shortest s-t path reconﬁguration problem. All of
them are based on DD operations. Computer experi-
ments were conducted to compare these algorithms.
We believe that the value of this study is that it
showed that ZDD operations can solve combinatorial
reconﬁguration problems under various rules. Future
work includes considering what rules of combinato-
rial reconﬁguration problems our method can be ap-
plied to.
ACKNOWLEDGEMENTS
This work was partially supported by JSPS KAK-
ENHI Grant Numbers JP20H00605, JP20H05794,
JP20H05964, and JP23H04383.
REFERENCES
Bonsma, P. and Cereceda, L. (2009). Finding paths between
graph colourings: PSPACE-completeness and super-
polynomial distances. Theoretical Computer Science,
410(50):5215–5226.
Bonsma, P. S. (2017). Rerouting shortest paths in planar
graphs. Discrete Applied Mathematics, 231:95–112.
Bryant, R. E. (1986). Graph-based algorithms for Boolean
function manipulation. IEEE Transactions on Com-
puters, C-35(8):677–691.
Christen, R., Eriksson, S., Katz, M., Muise, C., Petrov, A.,
Pommerening, F., Seipp, J., Sievers, S., and Speck, D.
(2023). PARIS: planning algorithms for reconﬁguring
independent sets. In Gal, K., Now
´
e, A., Nalepa, G. J.,
Fairstein, R., and Radulescu, R., editors, ECAI 2023
- 26th European Conference on Artiﬁcial Intelligence,
September 30 - October 4, 2023, Krak
´
ow, Poland - In-
cluding 12th Conference on Prestigious Applications
of Intelligent Systems (PAIS 2023), volume 372 of
Frontiers in Artiﬁcial Intelligence and Applications,
pages 453–460. IOS Press.
Hayase, K., Sadakane, K., and Tani, S. (1995). Output-size
sensitiveness of OBDD construction through maximal
independent set problem. In Du, D.-Z. and Li, M., ed-
itors, Computing and Combinatorics, pages 229–234,
Berlin, Heidelberg. Springer Berlin Heidelberg.
Ito, T., Demaine, E. D., Harvey, N. J. A., Papadimitriou,
C. H., Sideri, M., Uehara, R., and Uno, Y. (2011). On
the complexity of reconﬁguration problems. Theoret-
ical Computer Science, 412(12–14):1054–1065.
Ito, T., Kawahara, J., Nakahata, Y., Soh, T., Suzuki, A.,
Teruyama, J., and Toda, T. (2023). ZDD-based al-
gorithmic framework for solving shortest reconﬁgu-
ration problems. In 20th International Conference
on the Integration of Constraint Programming, Artiﬁ-
cial Intelligence, and Operations Research (CPAIOR
2023), pages 167–183.
Kami
´
nski, M., Medvedev, P., and Milani
ˇ
c, M. (2011).
Shortest paths between shortest paths. Theoretical
Computer Science, 412(39):5205–5210.
Kawahara, J., Inoue, T., Iwashita, H., and Minato, S.
(2017). Frontier-based search for enumerating all con-
strained subgraphs with compressed representation.
IEICE Transactions on Fundamentals of Electron-
ics, Communications and Computer Sciences, E100-
A(9):1773–1784.
Knuth, D. E. (2011). The Art of Computer Program-
ming, Volume 4A, Combinatorial Algorithms, Part 1.
Addison-Wesley Professional, 1st edition.
Minato, S. (1993). Zero-suppressed BDDs for set manip-
ulation in combinatorial problems. In Proc. of the
30th ACM/IEEE design automation conference, pages
272–277.
Nishimura, N. (2018). Introduction to reconﬁguration. Al-
gorithms, 11(4):52.
Okuno, H. G., Minato, S., and Isozaki, H. (1998). On the
properties of combination set operations. Information
Processing Letters, 66(4):195–199.
Soh, T., Okamoto, Y., and Ito, T. (2022). Core chal-
lenge 2022: Solver and graph descriptions. CoRR,
abs/2208.02495.
Toda, T., Ito, T., Kawahara, J., Soh, T., Suzuki, A., and
Teruyama, J. (2023). Solving reconﬁguration prob-
lems of ﬁrst-order expressible properties of graph ver-
tices with boolean satisﬁability. In The 35th IEEE In-
ternational Conference on Tools with Artiﬁcial Intel-
ligence, pages 294–302.
Yamada, Y., Banbara, M., Inoue, K., and Schaub, T.
(2023). Recongo: Bounded combinatorial recon-
ﬁguration with answer set programming. In Logics
in Artiﬁcial Intelligence: 18th European Conference,
JELIA 2023, Dresden, Germany, September 20–22,
2023, Proceedings, pages 278–286, Berlin, Heidel-
berg. Springer-Verlag.
ICAART 2024 - 16th International Conference on Agents and Artiﬁcial Intelligence
648