Canonization of a Random Circulant Graph by Counting Walks

Oleg Verbitsky 0001, Maksim Zhukovskii 0001. Canonization of a Random Circulant Graph by Counting Walks. In Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen, editors, WALCOM: Algorithms and Computation - 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18-20, 2024, Proceedings. Volume 14549 of Lecture Notes in Computer Science, pages 319-334, Springer, 2024. [doi]

Abstract

Abstract is missing.