5606 search results - page 23 / 1122 » Randomization Techniques for Graphs. |
170
Voted
ISAAC
2010
Springer
15 years 1 months ago
2010
Springer
We study line systems in metric spaces induced by graphs. A line is a subset of vertices defined by a relation of betweeness. We show that the class of all graphs having exactly k ...
118
Voted
MIDDLEWARE
2004
Springer
15 years 8 months ago
2004
Springer
Simulation studies are frequently used to evaluate new peer-to-peer searching techniques as well as existing techniques on new applications. Unless these studies are accurate in th...
128
Voted
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(...
129
click to vote
WEA
2005
Springer
15 years 8 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
130
click to vote
EJC
2008
15 years 3 months ago
2008
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...