Testing Euclidean Spanners

13 years 5 months ago

Download www.wisdom.weizmann.ac.il

In this paper we develop a property testing algorithm for the problem of testing whether a directed geometric graph with bounded (out)degree is a (1 + )-spanner.

Frank Hellweg, Melanie Schmidt, Christian Sohler

Real-time Traffic

Algorithms | Directed Geometric Graph | ESA 2010 | Property Testing Algorithm |

claim paper

» Spanners Weak Spanners and Power Spanners for Wireless Networks

» Improved Algorithms for Constructing FaultTolerant Spanners

» On Geometric Spanners of Euclidean and Unit Disk Graphs

» Computing the Greedy Spanner in NearQuadratic Time

» Light Orthogonal Networks with Constant Geometric Dilation

» Balancing Degree Diameter and Weight in Euclidean Spanners

» Geometric Spanners for Weighted Point Sets

» Randomized and deterministic algorithms for geometric spanners of small diameter

Post Info
More Details (n/a)

Added	09 Nov 2010
Updated	09 Nov 2010
Type	Conference
Year	2010
Where	ESA
Authors	Frank Hellweg, Melanie Schmidt, Christian Sohler

Comments (0)

Sciweavers

Testing Euclidean Spanners

Algorithms | Directed Geometric Graph | ESA 2010 | Property Testing Algorithm |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers