1591 search results - page 142 / 319 » Random lifts of graphs |
224
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
For undirected graphs it has been known for some time that one can bound the diameter using the eigenvalues. In this note we give a similar result for the diameter of strongly con...
178
click to vote
ESA
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
206
click to vote
ADHOCNOW
2005
Springer
16 years 11 hour ago
2005
Springer
The Hierarchical Layer Graph (HL graph) is a promising network topology for wireless networks with variable transmission ranges. It was introduced and analyzed by Meyer auf der He...
138
click to vote
COMBINATORICA
2004
15 years 6 months ago
2004
We present a new method to show concentration of the upper tail of random variables that can be written as sums of variables with plenty of independence. We compare our method with...
169
click to vote
CRYPTO
2007
Springer
16 years 19 days ago
2007
Springer
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}â...