I/O-efficient shortest path queries in geometric spanners (Q4778563)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1830742
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | I/O-efficient shortest path queries in geometric spanners |
scientific article; zbMATH DE number 1830742 |
Statements
18 November 2002
0 references
0.7946391701698303
0 references
0.7837010025978088
0 references
0.780853271484375
0 references
0.777470588684082
0 references
I/O-efficient shortest path queries in geometric spanners (English)
0 references