A Strongly Polynomial Time Algorithm for the Shortest Path Problem on Coherent Planar Periodic Graphs (Q4909556)
From MaRDI portal
scientific article; zbMATH DE number 6147824
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Strongly Polynomial Time Algorithm for the Shortest Path Problem on Coherent Planar Periodic Graphs |
scientific article; zbMATH DE number 6147824 |
Statements
A Strongly Polynomial Time Algorithm for the Shortest Path Problem on Coherent Planar Periodic Graphs (English)
0 references
21 March 2013
0 references
