Sciweavers

865 search results - page 11 / 173
» Random graph models for the web graph
Sort
View
DM
2008
81views more  DM 2008»
13 years 8 months ago
The diameter of protean graphs
Abstract. The web graph is a real-world self-organizing network whose vertices correspond to web pages, and whose edges correspond to links between pages. Many stochastic models fo...
Pawel Pralat
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
14 years 3 days ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
14 years 2 months ago
Implementing Huge Sparse Random Graphs
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...
Moni Naor, Asaf Nussboim
RSA
2010
118views more  RSA 2010»
13 years 3 months ago
Asymptotic equivalence and contiguity of some random graphs
We show that asymptotic equivalence, in a strong form, holds between two random graph models with slightly differing edge probabilities under substantially weaker conditions than w...
Svante Janson