Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (Q988687): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On sparse spanners of weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The buffer tree: A technique for designing batched external data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4425956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition of multidimensional point sets with applications to <i>k</i> -nearest-neighbors and <i>n</i> -body potential fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: NEW SPARSENESS RESULTS ON GRAPH SPANNERS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for computing geometric spanners and approximate shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for Constructing Sparse Euclidean Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Data Structure for Dynamically Maintaining Rooted Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: I/O-efficient well-separated pair decomposition and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Greedy Algorithms for Constructing Sparse Geometric Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829019 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: I/O-Efficiently Pruning Dense Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4428992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for constructing fault-tolerant spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4778563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Spanner Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4428993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures for External Memory / rank
 
Normal rank

Revision as of 02:03, 3 July 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
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references