A strongly polynomial time algorithm for the shortest path problem on coherent planar periodic graphs (Q4909556)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A strongly polynomial time algorithm for the shortest path problem on coherent planar periodic graphs |
scientific article; zbMATH DE number 6147824
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8080391883850098
0 references
0.7996600270271301
0 references
0.7829535603523254
0 references
0.7589618563652039
0 references
