103 search results - page 1 / 21 » The Cover Time of Random Digraphs |
APPROX
2007
Springer
14 years 5 months ago
2007
Springer
We study the cover time of a random walk on the random digraph Dn,p when np =
CORR
2011
Springer
13 years 6 months ago
2011
Springer
We study properties of a simple random walk on the random digraph Dn,p when
DM
2008
13 years 10 months ago
2008
For two or more classes of points in Rd with d 1, the class cover catch digraphs (CCCDs) can be constructed using the relative positions of the points from one class with respect...
APPROX
2004
Springer
14 years 4 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
INFOCOM
2010
IEEE
13 years 9 months ago
2010
IEEE
—In this paper we develop a unified theoretical framework for estimating various transmission costs of packet forwarding in wireless networks. Our framework can be applied to th...