5606 search results - page 42 / 1122 » Randomization Techniques for Graphs. |
STOC
2009
ACM
14 years 9 months ago
2009
ACM
The classical zero-one law for first-order logic on random graphs says that for every first-order property in the theory of graphs and every p (0, 1), the probability that the r...
ICOIN
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
RSA
2010
13 years 3 months ago
2010
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...
WWW
2007
ACM
14 years 9 months ago
2007
ACM
This paper proposes a random Web crawl model. A Web crawl is a (biased and partial) image of the Web. This paper deals with the hyperlink structure, i.e. a Web crawl is a graph, w...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...