On plane geometric spanners: a survey and open problems (Q359741): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Principles of Distributed 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: An optimal algorithm for approximate nearest neighbor searching fixed dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plane Spanners of Maximum Degree Six / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Stretch Factor of L 1- and L  ∞ -Delaunay Triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bounded degree plane strong geometric spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Stretch Factor of Convex Delaunay Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication-Efficient Construction of the Plane Localized Delaunay Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: π/2-ANGLE YAO GRAPHS ARE SPANNERS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Spanning Ratio of Gabriel Graphs and beta-Skeletons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On plane constrained bounded-degree spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing plane spanners of bounded degree and low weight / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Generalized Diamond Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating geometric bottleneck shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a minimum-dilation spanning tree is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: There are planar graphs almost as good as the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stretch factor of Delaunay triangulations of points in convex position / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONSTRUCTING DEGREE-3 SPANNERS WITH OTHER SPARSENESS PROPERTIES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3484375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delaunay graphs are almost as good as complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geometric dilation of closed curves, graphs, and point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometric dilation of finite point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: EMBEDDING POINT SETS INTO PLANE GRAPHS OF SMALL DILATION / 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: Q4910737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Spanners and Lightweight Spanners of Geometric Graphs / 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: Q3601548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Geometric Minimum-Dilation Graphs Is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER / rank
 
Normal rank
Property / cites work
 
Property / cites work: I/O-efficient algorithms for computing planar geometric spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-weight triangulation is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Spanner Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bound on the stretch factor of delaunay triangulations / rank
 
Normal rank

Latest revision as of 18:33, 6 July 2024

scientific article
Language Label Description Also known as
English
On plane geometric spanners: a survey and open problems
scientific article

    Statements

    On plane geometric spanners: a survey and open problems (English)
    0 references
    0 references
    0 references
    22 August 2013
    0 references
    spanners
    0 references
    plane graphs
    0 references
    Delaunay triangulations
    0 references
    dilation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers