256 search results - page 2 / 52 » Sparse random graphs with clustering |
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
AIRS
2006
Springer
13 years 9 months ago
2006
Springer
Document clustering techniques mostly depend on models that impose explicit and/or implicit priori assumptions as to the number, size, disjunction characteristics of clusters, and/...
STOC
2000
ACM
13 years 9 months ago
2000
ACM
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
IPPS
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
JACM
2010
13 years 3 months ago
2010
We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic f...