2079 search results - page 46 / 416 » Universality of random graphs |
139
click to vote
COMBINATORICS
2004
15 years 3 months ago
2004
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
163
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
164
click to vote
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
—This paper focuses on the Internet IP-level routing topology and proposes relevant explanations to its apparent dynamics. We first represent this topology as a power-law random...
122
click to vote
JGT
2010
15 years 2 months ago
2010
While finite cop-win finite graphs possess a good structural characterization, none is known for infinite cop-win graphs. As evidence that such a characterization might not exis...
134
click to vote
WEA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...