Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (Q988687): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jda.2010.03.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2054204720 / rank | |||
Normal rank | |||
Revision as of 02:06, 20 March 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
