617 search results - page 44 / 124 » On the Chromatic Number of Random Graphs |
126
click to vote
INFOCOM
2003
IEEE
15 years 9 months ago
2003
IEEE
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...
135
click to vote
RSA
2006
15 years 4 months ago
2006
Motivated by a problem that arises in the study of mirrored storage systems, we describe, for any fixed , > 0 and any integer d 2, explicit or randomized constructions of d-r...
115
Voted
SAGA
2007
Springer
15 years 10 months ago
2007
Springer
In the layered-graph query model of network discovery, a query at a node v of an undirected graph G discovers all edges and non-edges whose endpoints have different distance from ...
136
click to vote
EJC
2006
15 years 4 months ago
2006
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
ENDM
2006
15 years 4 months ago
2006
Jim Propp's rotor router model is a simple deterministic analogue of a random walk. Instead of distributing chips randomly, it serves the neighbors in a fixed order. We analy...