292 search results - page 35 / 59 » Scaling properties of the Internet graph |
195
click to vote
ADHOCNOW
2004
Springer
15 years 11 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 ...
153
Voted
WWW
2002
ACM
16 years 6 months ago
2002
ACM
The Web graph is a giant social network whose properties have been measured and modeled extensively in recent years. Most such studies concentrate on the graph structure alone, an...
164
Voted
WWW
2007
ACM
16 years 6 months ago
2007
ACM
The aggregation and comparison of behavioral patterns on the WWW represent a tremendous opportunity for understanding past behaviors and predicting future behaviors. In this paper...
152
Voted
WWW
2007
ACM
16 years 6 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
171
click to vote
WEBI
2007
Springer
16 years 5 days ago
2007
Springer
Web sites are often organized into several regions, each dedicated to a specific topic or serving a particular function. From a user’s perspective, these regions typically form ...