A Strongly Polynomial Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs

Yutaro Yamaguchi 0001. A Strongly Polynomial Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs. In Shuchi Chawla 0001, editor, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020. pages 1923-1932, SIAM, 2020. [doi]

Abstract

Abstract is missing.