3 search results - page 1 / 1 » A Breadth-First Approach to Memory-Efficient Graph Search |
88
Voted
AAAI
2006
14 years 12 months ago
2006
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
With more than 250 million active users, Facebook (FB) is currently one of the most important online social networks. Our goal in this paper is to obtain a representative (unbiased...