2079 search results - page 12 / 416 » Universality of random graphs |
AML
2004
14 years 11 months ago
2004
Assuming CH, let 1 be the saturated random graph of cardinal
GD
2007
Springer
15 years 6 months ago
2007
Springer
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this ...
DCG
2010
14 years 12 months ago
2010
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this...
RSA
2006
14 years 11 months ago
2006
Consider the random graph model of Barab
125
click to vote
DIALM
2008
ACM
15 years 1 months ago
2008
ACM
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...