Collective Tree Spanners for Unit Disk Graphs with Applications

DOI10.1016/j.endm.2009.02.016zbMath1267.05255OpenAlexW2000218046MaRDI QIDQ2839219

Feodor F. Dragan, Chenyu Yan, Yang Xiang

Publication date: 4 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.02.016

zbMATH Keywords

balanced separatorscollective tree spannersrouting and distance labeling schemesunit disk graphsefficient graph algorithms

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Geometric ad-hoc routing
• A Separator Theorem for Planar Graphs
• Distributed Computing: A Locality-Sensitive Approach
• Collective tree spanners of graphs

This page was built for publication: Collective Tree Spanners for Unit Disk Graphs with Applications