Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (Q988687): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jda.2010.03.001 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JDA.2010.03.001 / rank | |||
Normal rank | |||
Latest revision as of 11:32, 10 December 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
