592 search results - page 28 / 119 » Crossing numbers of random graphs |
ICCTA
2007
IEEE
13 years 11 months ago
2007
IEEE
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
RSA
2010
13 years 6 months ago
2010
We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset S of the nonnegative integers. Subject to a certain hypothesis on S, the...
ICDT
2007
ACM
14 years 2 months ago
2007
ACM
We consider random graphs, and their extensions to random structures, with edge probabilities of the form βn−α , where n is the number of vertices, α, β are fixed and α >...
COMBINATORICS
2004
13 years 7 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...
RSA
2011
13 years 2 months ago
2011
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...