Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (Q988687): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:13, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies |
scientific article |
Statements
Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (English)
0 references
18 August 2010
0 references
external-memory algorithms
0 references
cache-oblivious algorithms
0 references
geometric graphs
0 references
spanners
0 references
well-separated pair decomposition
0 references
