Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time (Q3586397): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 04:05, 5 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time |
scientific article |
Statements
Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time (English)
0 references
6 September 2010
0 references