Efficient construction of low weight bounded degree planar spanner

DOI10.1007/3-540-45071-8_38zbMATH Open1276.68162OpenAlexW1504049780MaRDI QIDQ3082944FDOQ3082944

Authors: Yu Wang, Xiangyang Li 

Publication date: 18 March 2011

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

Full work available at URL: https://doi.org/10.1007/3-540-45071-8_38

Recommendations

• EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER
• scientific article; zbMATH DE number 1947396
• Constructing plane spanners of bounded degree and low weight
• On geometric spanners of Euclidean and unit disk graphs
• On spanners and lightweight spanners of geometric graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (13)

• Communication-efficient construction of the plane localized Delaunay graph
• On spanners and lightweight spanners of geometric graphs
• On geometric spanners of Euclidean and unit disk graphs
• Efficient construction of a bounded-degree spanner with low weight
• Local solutions for global problems in wireless networks
• Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges
• Title not available (Why is that?)
• Computing Lightweight Spanners Locally
• Improved local algorithms for spanner construction
• Local routing in sparse and lightweight geometric graphs
• EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER
• Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs
• Constructing plane spanners of bounded degree and low weight

This page was built for publication: Efficient construction of low weight bounded degree planar spanner

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