Deformable spanners and applications
نویسندگان
چکیده
منابع مشابه
Spanners for geometric intersection graphs with applications
A disk graph is an intersection graph of a set of disks with arbitrary radii in the plane. Given a real number t > 1, we say that a subgraph G of a graph G is a t-spanner for G, if for every pair of vertices u, v in G, there exists a path in G of length at most t times the distance between u and v in G. In this paper, we consider the problem of efficient construction of sparse spanners of disk ...
متن کاملGeometric spanners with applications in wireless networks
In this paper we investigate the relations between spanners, weak spanners, and power spanners in R D for any dimension D and apply our results to topology control in wireless networks. For c ∈ R, a c-spanner is a subgraph of the complete Euclidean graph satisfying the condition that between any two vertices there exists a path of length at most c-times their Euclidean distance. Based on this a...
متن کاملSpanners, Weak Spanners, and Power Spanners for Wireless Networks
For , a -spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most times their geometric distance. Based on this property to approximate a complete weighted graph, sparse spanners have found many applications, e.g., in FPTAS, geometric searching, and radio networks. In a weak -spanner, this path may be arbitrary l...
متن کاملCollective Tree Spanners for Unit Disk Graphs with Applications
In this paper, we establish a novel balanced separator theorem for Unit Disk Graphs (UDGs), which mimics the well-known Lipton and Tarjan’s planar balanced shortest paths separator theorem. We prove that, in any n-vertex UDG G, one can find two hop-shortest paths P (s, x) and P (s, y) such that the removal of the 3-hopneighborhood of these paths (i.e., N G[P (s, x)∪P (s, y)]) from G leaves no c...
متن کاملOn Spanners and Lightweight Spanners of Geometric Graphs
We consider the problem of computing spanners of Euclidean and unit disk graphs embedded in the two-dimensional Euclidean plane. We are particularly interested in spanners that possess useful properties such as planarity, bounded degree, and/or light weight. Such spanners have been extensively studied in the area of computational geometry and have been used as the building block for constructin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2006
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2005.10.001