Y. Asahiro, K. Iwama, H. Tamaki, and T. Tokuyama, Greedily Finding a Dense Subgraph, Journal of Algorithms, vol.34, issue.2, pp.203-221, 2000.
DOI : 10.1006/jagm.1999.1062

M. Cha, H. Haddadi, F. Benevenuto, and K. P. Gummadi, Measuring user influence in Twitter: The million follower fallacy, Proc. of ICWM, p.8, 2010.

M. Charikar, Greedy Approximation Algorithms for Finding Dense Components in a Graph, Proc. of APPROX, pp.139-152, 2000.
DOI : 10.1007/3-540-44436-X_10

G. Chockler, R. Melamed, Y. Tock, and R. Vitenberg, Constructing scalable overlays for pub-sub with many topics, Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, PODC '07, pp.109-118, 2007.
DOI : 10.1145/1281100.1281118
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.4044

J. Dean and S. Ghemawat, MapReduce, Communications of the ACM, vol.51, issue.1, pp.107-113, 2008.
DOI : 10.1145/1327452.1327492

U. Feige, A threshold of ln n for approximating set cover, Journal of the ACM, vol.45, issue.4, pp.634-652, 1998.
DOI : 10.1145/285055.285059

B. A. Huberman, D. M. Romero, and F. Wu, Social networks that matter: Twitter under the microscope, First Monday, vol.14, issue.1, 2009.
DOI : 10.2139/ssrn.1313405
URL : http://arxiv.org/abs/0812.1045

J. Leskovec and C. Faloutsos, Sampling from large graphs, Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '06, pp.631-636, 2006.
DOI : 10.1145/1150402.1150479

M. E. Newman, The Structure and Function of Complex Networks, SIAM Review, vol.45, issue.2, pp.167-256, 2003.
DOI : 10.1137/S003614450342480

A. Silberstein, J. Terrace, B. F. Cooper, and R. Ramakrishnan, Feeding frenzy, Proceedings of the 2010 international conference on Management of data, SIGMOD '10, pp.831-842, 2010.
DOI : 10.1145/1807167.1807257