1542 search results - page 51 / 309 » The metamathematics of random graphs |
WWW
2007
ACM
15 years 10 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...
STOC
2007
ACM
15 years 10 months ago
2007
ACM
STACS
2007
Springer
15 years 3 months ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
MFCS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We present algorithmic lower bounds on the size of the largest independent sets of vertices in a random d-regular graph. Our bounds hold with probability approaching one ...
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
We observe a certain random process on a graph ”locally”, i.e., in the neighborhood of a node, and would like to derive information about ”global” properties of the graph....