1949 search results - page 36 / 390 » Random graphs on surfaces |
103
click to vote
RSA
2008
14 years 11 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
RSA
2011
14 years 6 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...
CPC
1998
14 years 11 months ago
1998
Given a sequence of non-negative real numbers 0 1 ::: which sum to 1, we consider a random graph having approximately in vertices of degree i. In 12] the authors essentially show ...
CODCRY
2009
Springer
15 years 6 months ago
2009
Springer
ESA
2010
Springer
15 years 28 days ago
2010
Springer
