Managing and Mining Graph Data part 53 is a comprehensive survey book in graph data analytics. It contains extensive surveys on important graph topics such as graph languages, indexing, clustering, data generation, pattern mining, classification, keyword search, pattern matching, and privacy. It also studies a number of domain-specific scenarios such as stream mining, web graphs, social networks, chemical and biological data. The chapters are written by leading researchers, and provide a broad perspective of the area. This is the first comprehensive survey book in the emerging topic of graph data processing. . | Graph Mining Applications to Social Network Analysis 5509 11 U. Brandes. D. Dolling. M. Gaerllcr. R. Gorkc. M. Hoefer Z. Nikoloski and D. Wagner. Maximizing modularity is hard. Arxiv preprint physics 0608255 2006. 12 T. Bu and D. Towsley. On distinguishing between internet power law topology generators. In Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies volume 2 pages 638647 . 2002. 13 L. Si. Buriol G. irahling. S. Leonard. A. Marchetti-Spaccamela and 2. Sohler. Counting triangles in data streams. In IPODS 06 Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems paees 253-262 New York NY USA 2006. ACM. 14 D. fjiitdisal arti an. C. Bi ioi itJiCis. Graph mining Laws generators and algoriihms. ACM Comput. Surv. 38 l 2 2006. 15 A. Mi Mow-man. and St. Mooge. Finding community structure in very lasge networks. Arxiv preprint cond-mat 0408187 2004. 16 A. Clauset. Ci Moore. and Mi E. J Newman. Hierarchical structure and the pscdiction of missing links in networks. Nature 453 9U 101 2008. 17 A. au e t C IL Shalizi. aod M. Es Ji Newman. Power-law distributions in empirical data. arXiv 706 2007. 18 J Diesner T. L. FrantZi and K. Ml. Cl rs ley. Communication networks from the enron emaii coipus itis always about the people enron is no diflctcnt . Comput. Math. Organ. Theory ll 3 201-228 2005. 19 Y DourishousCi F. Geraci and M. Pehegrini. Extraction and classification it dense communities in the weh. In 11 00 07 Proceedings of the 16th international conference on World Wide Web paics 461-470 New York NY USA 2007. ACM. 20 P. Erdns and A. Renyi. On tit evolution oO random graphs. Publ. Math. Inst. Hung. Acad. Sci 5 17-61. I960. 21 M. J -rnsoi. P I rldi tti ir and C. Ilaioutsos. On power-law relationships of the intetnct topology. In SIGCOMM 99 Proceedings of the conference on Applications technologies architectures and protocols for computer communic ation juig -s 251 26 . New York
