1542 search results - page 152 / 309 » The metamathematics of random graphs |
108
click to vote
MFCS
2004
Springer
15 years 7 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
150
click to vote
COMBINATORICS
2006
15 years 1 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...
118
click to vote
ESA
2004
Springer
15 years 7 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...
134
click to vote
ADHOCNOW
2005
Springer
15 years 7 months 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...
80
Voted
COMBINATORICA
2004
15 years 1 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...