47 search results - page 5 / 10 » On Geometric Spanners of Euclidean and Unit Disk Graphs |
112
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
67
Voted
DAGSTUHL
2006
15 years 3 months ago
2006
139
Voted
COMGEO
1999
ACM
15 years 1 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
123
click to vote
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protoco...
108
Voted
RSA
2006
15 years 1 months ago
2006
Let n be a positive integer and > 0 a real number. Let Vn be a set of n points in the unit disk selected uniformly and independently at random. Define G(, n) to be the graph w...