1542 search results - page 2 / 309 » The metamathematics of random graphs |
149
click to vote
ISAAC
2010
Springer
14 years 11 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 ...
108
click to vote
SIAMDM
2010
14 years 8 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(...
CPC
2000
15 years 1 months ago
2000
COMBINATORICA
1999
15 years 1 months ago
1999
148
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the re...