1949 search results - page 168 / 390 » Random graphs on surfaces |
176
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
141
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the ba...
172
click to vote
ADHOCNOW
2004
Springer
15 years 10 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
132
click to vote
IM
2006
15 years 4 months ago
2006
We propose a new random model of web graphs in which the degree of a vertex depends on its age. We characterize the degree sequence of this model and study its behaviour near the c...
163
click to vote
ICDM
2010
IEEE
15 years 2 months ago
2010
IEEE
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...