A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon (Q4640339)
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: A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon |
scientific article; zbMATH DE number 6869485
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon |
scientific article; zbMATH DE number 6869485 |
Statements
A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon (English)
0 references
17 May 2018
0 references
computational geometry
0 references
memory-constrained algorithms
0 references
shortest path tree
0 references
0 references
0.9233195
0 references
0 references
0.9096315
0 references
0.9059684
0 references
0.9039371
0 references
0.9034018
0 references
0.9027106
0 references
0.9027106
0 references
0.8999361
0 references
