1949 search results - page 8 / 390 » Random graphs on surfaces |
RSA
2010
13 years 5 months ago
2010
: We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homoge...
ENDM
2002
13 years 7 months ago
2002
It is well-known that the maximal size of minimally 3-connected graphs of order 7n is 93 -n . In this paper, we shall prove that if G is a minimally 3-connected graph of order n, ...
MJ
2006
13 years 7 months ago
2006
Surface relief formed by nanoimprinting and etching into a thermally grown SiO2 layer on Si was used to position the initial nuclei formed by chemically vapor deposited Si and Ge....
ESA
2005
Springer
14 years 28 days ago
2005
Springer
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
RSA
2006
13 years 7 months ago
2006
We analyze Markov chains for generating a random k-coloring of a random graph Gn,d/n. When the average degree d is constant, a random graph has maximum degree (log n/ log log n), ...