Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time (Q3586397)
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: Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time |
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
