1591 search results - page 7 / 319 » Random lifts of graphs |
LATIN
2000
Springer
15 years 1 months ago
2000
Springer
We look at the minimal size of a maximal matching in general, bipartite and
AML
2004
14 years 9 months ago
2004
Assuming CH, let 1 be the saturated random graph of cardinal
RSA
2006
14 years 9 months ago
2006
Consider the random graph model of Barab
108
click to vote
DIALM
2008
ACM
14 years 11 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 ...
102
click to vote
SODA
2001
ACM
14 years 11 months ago
2001
ACM
Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by so-called the "power law". Here we determin...