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

doi 10.1137/1.9781611975994.118
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics