49 search results - page 3 / 10 » New Sparseness Results on Graph Spanners |
ICDCS
2002
IEEE
15 years 2 months ago
2002
IEEE
Abstract—We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efficiently in a distributed manner. It integrates the connected dominating se...
PROPERTYTESTING
2010
14 years 7 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 ...
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
CORR
2012
Springer
13 years 5 months ago
2012
Springer
A h-uniform hypergraph H = (V, E) is called ( , k)-orientable if there exists an assignment of each hyperedge e ∈ E to exactly of its vertices v ∈ e such that no vertex is ass...
77
Voted
PODC
2006
ACM
15 years 3 months ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...