Near-optimal algorithms for shortest paths in weighted unit-disk graphs (Q2223616)
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: Near-optimal algorithms for shortest paths in weighted unit-disk graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Near-optimal algorithms for shortest paths in weighted unit-disk graphs |
scientific article |
Statements
Near-optimal algorithms for shortest paths in weighted unit-disk graphs (English)
0 references
29 January 2021
0 references
single-source shortest paths
0 references
weighted unit-disk graphs
0 references
geometric graph algorithms
0 references
0 references
0 references
0.95393157
0 references
0.9479867
0 references
0.9134484
0 references
0.9074805
0 references
0.90720505
0 references
0.9051987
0 references
0.90190005
0 references
