Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time (Q3586397): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q60143025, #quickstatements; #temporary_batch_1707149277123 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q60143025 / rank | |||
Normal rank | |||
Revision as of 20:17, 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
