I/O-efficient algorithms for computing planar geometric spanners (Q929749): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: On external-memory MST, SSSP and multi-way planar graph separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: External-memory algorithms for processing line segments in geographic information systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar spanners and approximate shortest path queries among obstacles in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Organization and maintenance of large ordered indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886056 / 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: RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945509 / 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: A new data structure for representing sorted lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: An external memory data structure for shortest path queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of graphs which approximate the complete Euclidean graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for memory hierarchies. Advanced lectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Spanner Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparse graph almost as good as the complete graph on points in \(k\) dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Constructing Minimum Spanning Trees in <i>k</i>-Dimensional Spaces and Related Problems / rank
 
Normal rank

Latest revision as of 12:16, 28 June 2024

scientific article
Language Label Description Also known as
English
I/O-efficient algorithms for computing planar geometric spanners
scientific article

    Statements

    I/O-efficient algorithms for computing planar geometric spanners (English)
    0 references
    0 references
    0 references
    0 references
    18 June 2008
    0 references
    0 references
    external-memory algorithms
    0 references
    computational geometry
    0 references
    shortest paths
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references