PEGASUS - Large Scale and Big Data: Processing and Management - page 284

16. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins,
and J. Wiener. Graph structure in the web. Comput. Networks , 33(1):309-320, 2000.
17. B. V. Cherkassky, A. V. Goldberg, and T. Radzik. Shortest paths algorithms: Theory and
experimental evaluation. In SODA'94 , pages 516-525, Philadelphia, PA, USA, 1994.
Society for Industrial and Applied Mathematics.
18. E. Cohen. Size-estimation framework with applications to transitive closure and reach-
ability. J. Comput. Syst. Sci ., 55(3):441-453, 1997.
19. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms . The MIT Press, 1990.
20. D. Donato, L. Laura, S. Leonardi, and S. Millozzi. The web as a graph: How far we are.
ACM Trans. Internet Technol ., 7(1), 2007.
21. M. Durand and P. Flajolet. Loglog counting of large cardinalities (extended abstract). In
ESA , pages 605-617, 2003.
22. J.-A. Ferrez, K. Fukuda, and T. M. Liebling. Parallel computation of the diameter of
a graph. In High Performance Computing Systems and Applications , pages 283-296,
1998. Springer.
23. P. Flajolet and G. Nigel Martin. Probabilistic counting algorithms for data base applica-
tions. J. Comput. Syst. Sci. , 1985.
24. P. Flajolet, Eric Fusy, O. Gandouet et al. Hyperloglog: The analysis of a near-optimal
cardinality estimation algorithm. In AOFA'07: Proceedings of the 2007 International
Conference on Analysis of Algorithms , 2007.
25. S. Fortunato. Community detection in graphs. CoRR, abs/0906.0612, 2009.
26. P. Indyk and D. Woodruff. Tight lower bounds for the distinct elements problem. In
Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science,
pages 283-288, 2003. IEEE.
27. D. M. Kane, J. Nelson, and D. P. Woodruff. An optimal algorithm for the distinct elements
problem. In Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium
on Principles of Database Systems , PODS'10 , pages 41-52, New York, 2010. ACM.
28. U. Kang, C. E. Tsourakakis, A. P. Appel, C. Faloutsos, and J. Leskovec. Hadi: Mining
radii of large graphs. ACM Trans. Knowl. Discov. Data , 5(2):8:1-8:24, 2011.
29. U. Kang, C. Tsourakakis, and C. Faloutsos. Pegasus: A peta-scale graph mining sys-
tem implementation and observations. In Ninth IEEE International Conference on Data
Mining, ICDM'09 , pages 229-238, 2009. IEEE.
30. H. Kwak, C. Lee, H. Park, and S. Moon. What is twitter, a social network or a news
media? In Proceedings of the 19th International Conference on World Wide Web ,
WWW'10 , pages 591-600, 2010. ACM.
31. J. Leskovec, D. Chakrabarti, J. M. Kleinberg, and C. Faloutsos. Realistic, mathemati-
cally tractable graph generation and evolution, using kronecker multiplication. In
PKDD , pages 133-145, 2005.
32. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graph evolution: Densiication and shrink-
ing diameters. ACM Trans. Knowl. Discov. Data , 1(1):2, 2007.
33. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Statistical properties of com-
munity structure in large social and information networks. In Proceedings of the 17th
International Conference on World Wide Web , pages 695-704, 2008. ACM.
34. Y. Low, D. Bickson, J. Gonzalez, C. Guestrin, A. Kyrola, and J. M. Hellerstein.
Distributed graphlab: A framework for machine learning and data mining in the cloud.
Proc. VLDB Endow. , 5(8):716-727, 2012.
35. J. Ma and S. Ma. Eficient parallel algorithms for some graph theory problems. J.
Comput. Sci. Technol. , 8(4):362-366, 1993.
36. G. Malewicz, M. H. Austern, A. J. C. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G.
Czajkowski. Pregel: A system for large-scale graph processing. In Proceedings of the
2010 ACM SIGMOD International Conference on Management of Data , pages 135-
146, 2010. ACM.