103 search results - page 5 / 21 » The Cover Time of Random Digraphs |
116
Voted
SODA
1997
ACM
15 years 4 months ago
1997
ACM
Improving on a recent breakthrough of Sharir, we find two minimum-radius circular disks covering a planar point set, in randomized expected time O(n log2 n).
127
click to vote
SIAMDM
2010
14 years 10 months ago
2010
If m 2 is constant and 0 r log log n for a small positive constant , then whp a random walk with look-ahead r on a scale-free graph G = G(m, n) has cover time CG(r) (2/(mr-1(...
106
Voted
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
159
click to vote
MSWIM
2006
ACM
15 years 9 months ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
129
Voted
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...