2079 search results - page 125 / 416 » Universality of random graphs |
138
Voted
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...
125
click to vote
EJC
2007
15 years 4 months ago
2007
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
146
Voted
SIGMETRICS
2003
ACM
15 years 10 months ago
2003
ACM
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
151
click to vote
DM
2011
14 years 11 months ago
2011
The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to an...
112
Voted
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract— In this contribution the radio channel model proposed in [1] is extended to include multiple transmitters and receivers. The propagation environment is modelled using r...