1542 search results - page 10 / 309 » The metamathematics of random graphs |
CPC
2010
13 years 7 months ago
2010
We study the diameter of C1, the largest component of the Erdos-R
COMBINATORICA
2010
13 years 7 months ago
2010
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
CN
2010
13 years 6 months ago
2010
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
RSA
2008
13 years 9 months ago
2008
We study the cover time of a random walk on the largest component of the random graph Gn,p. We determine its value up to a factor 1 + o(1) whenever np = c > 1, c = O(ln n). In ...
RSA
2008
13 years 9 months ago
2008
: Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player ...