Computing Lightweight Spanners Locally

DOI10.1007/978-3-540-87779-0_25MaRDI QIDQ3540243zbMATH OpenOpenAlexFDO

Authors Ljubomir Perković, Ge Xia, Iyad Kanj

Publication date 20 November 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-87779-0_25

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)

Recommendations

• On spanners and lightweight spanners of geometric graphs
• On Spanners of Geometric Graphs
• EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER
• On geometric spanners of Euclidean and unit disk graphs
• Efficient construction of low weight bounded degree planar spanner

Cited in

(9)

• On spanners and lightweight spanners of geometric graphs
• Local approximation schemes for topology control
• Average size of unstretched remote-spanners
• Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges
• DISTRIBUTED SPANNERS WITH BOUNDED DEGREE FOR WIRELESS AD HOC NETWORKS
• Light spanners
• On Spanners of Geometric Graphs
• Analysing local algorithms in location-aware quasi-unit-disk graphs
• Approximate MST for UDG locally

This page was built for publication: Computing Lightweight Spanners Locally

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540243)