A strongly polynomial algorithm for finding a shortest non-zero path in group-labeled graphs

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fingerprint Dive into the research topics of 'A strongly polynomial algorithm for finding a shortest non-zero path in group-labeled graphs'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science