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

DOI10.1137/1.9781611975994.118OpenAlexW3002550154MaRDI QIDQ5146903

Yutaro Yamaguchi

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.04062

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: A Strongly Polynomial Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs