116 search results - page 6 / 24 » Testing Euclidean Spanners |
104
click to vote
SPAA
2005
ACM
15 years 5 months ago
2005
ACM
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
ESA
2009
Springer
15 years 6 months ago
2009
Springer
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
TALG
2008
14 years 11 months ago
2008
Given a Euclidean graph G over a set P of n points in the plane, we are interested in verifying whether G is a Euclidean minimum spanning tree (EMST) of P or G differs from it in ...
PROPERTYTESTING
2010
14 years 9 months ago
2010
We survey results on transitive-closure spanners and their applications. Given a directed graph G = (V, E) and an integer k 1, a k-transitive-closure-spanner (k-TC-spanner) of G ...
IPL
2007
14 years 11 months ago
2007