1949 search results - page 30 / 390 » Random graphs on surfaces |
STOC
2007
ACM
16 years 3 days ago
2007
ACM
102
click to vote
STACS
2007
Springer
15 years 6 months ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
MFCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We present algorithmic lower bounds on the size of the largest independent sets of vertices in a random d-regular graph. Our bounds hold with probability approaching one ...
RSA
2011
14 years 6 months ago
2011
: We describe a simple and yet surprisingly powerful probabilistic technique which shows how to find in a dense graph a large subset of vertices in which all (or almost all) small...
101
click to vote
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the numb...