Sciweavers

3 search results - page 1 / 1
» A Breadth-First Approach to Memory-Efficient Graph Search
Sort
View
88
Voted
AAAI
2006
14 years 12 months ago
A Breadth-First Approach to Memory-Efficient Graph Search
Rong Zhou, Eric A. Hansen
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 5 months ago
Towards Unbiased BFS Sampling
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...
Maciej Kurant, Athina Markopoulou, Patrick Thiran
INFOCOM
2010
IEEE
14 years 10 months ago
Walking in Facebook: A Case Study of Unbiased Sampling of OSNs
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...
Minas Gjoka, Maciej Kurant, Carter T. Butts, Athin...