Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (Q988687)
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: Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies |
scientific article; zbMATH DE number 5772509
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies |
scientific article; zbMATH DE number 5772509 |
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
0.8633974
0 references
0 references
0.84055614
0 references
0.8354547
0 references
0.8354547
0 references
0.83329725
0 references
0.83329725
0 references
0.83279234
0 references
0.83279234
0 references
