Shortest paths in planar graphs with real lengths in \(O(n \log^{2} n/ \log \log n)\) 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(n ^2 n/ n) time |
scientific article; zbMATH DE number 5779714
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest paths in planar graphs with real lengths in \(O(n \log^{2} n/ \log \log n)\) time |
scientific article; zbMATH DE number 5779714 |
Statements
Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time (English)
0 references
6 September 2010
0 references
0.9355645775794984
0 references
0.932280659675598
0 references
0.9042728543281556
0 references
0.8835827112197876
0 references
0.8787513375282288
0 references
