598 search results - page 2 / 120 » A random graph model for massive graphs |
SODA
2008
ACM
13 years 6 months ago
2008
ACM
In the past decades the Gn,p model of random graphs, introduced by Erdos and R
SIGMOD
2010
ACM
13 years 10 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
TKDE
2008
13 years 5 months ago
2008
Abstract-- With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customer...
RSA
2006
13 years 5 months ago
2006
Consider the random graph model of Barab
DIALM
2008
ACM
13 years 6 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 ...