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 |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q60143025 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-15781-3_18 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1527270374 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:54, 20 March 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
