Plane hop spanners for unit disk graphs: simpler and better

DOI10.1016/j.comgeo.2020.101622zbMath1450.05083arXiv1902.10051OpenAlexW3006658089MaRDI QIDQ2206719

Ahmad Biniaz

Publication date: 23 October 2020

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.10051

zbMATH Keywords

Delaunay triangulationunit disk graphsquare gridplane hop spanner

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Sparse hop spanners for unit disk graphs ⋮ Unnamed Item

Cites Work

• On plane geometric spanners: a survey and open problems
• Compact and low delay routing labeling scheme for unit disk graphs
• Delaunay graphs are almost as good as complete graphs
• Discrete mobile centers
• On plane constrained bounded-degree spanners
• Encompassing colored planar straight line graphs
• Spanners for geometric intersection graphs with applications
• Geometric Spanner Networks
• EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER
• Unnamed Item
• Unnamed Item

This page was built for publication: Plane hop spanners for unit disk graphs: simpler and better