13 search results - page 3 / 3 » The Size of the Giant Component of a Random Graph with a Giv... |
RSA
2008
13 years 4 months ago
2008
In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...
JCO
2006
13 years 5 months ago
2006
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...