Plane hop spanners for unit disk graphs: simpler and better (Q2206719): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On plane constrained bounded-degree spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: On plane geometric spanners: a survey and open problems / 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: Q4945509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanners for geometric intersection graphs with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete mobile centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encompassing colored planar straight line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4910737 / 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: Geometric Spanner Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact and low delay routing labeling scheme for unit disk graphs / rank
 
Normal rank

Latest revision as of 22:45, 23 July 2024

scientific article
Language Label Description Also known as
English
Plane hop spanners for unit disk graphs: simpler and better
scientific article

    Statements

    Plane hop spanners for unit disk graphs: simpler and better (English)
    0 references
    0 references
    23 October 2020
    0 references
    unit disk graph
    0 references
    plane hop spanner
    0 references
    Delaunay triangulation
    0 references
    square grid
    0 references

    Identifiers

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