A Strongly Polynomial Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs (Q5146903)
From MaRDI portal
scientific article; zbMATH DE number 7304141
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Strongly Polynomial Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs |
scientific article; zbMATH DE number 7304141 |
Statements
A Strongly Polynomial Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs (English)
0 references
2 February 2021
0 references
