1591 search results - page 7 / 319 » Random lifts of graphs |
91
Voted
LATIN
2000
Springer
15 years 4 months ago
2000
Springer
We look at the minimal size of a maximal matching in general, bipartite and
74
Voted
AML
2004
15 years 17 days ago
2004
Assuming CH, let 1 be the saturated random graph of cardinal
135
click to vote
DIALM
2008
ACM
15 years 2 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 ...
125
Voted
SODA
2001
ACM
15 years 2 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...