Managing and Mining Graph Data part 4 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. . | MANAGING AND MINING GRAPH DATA 10 5 J. Cheng J. Xu Yu X. Lin H Wang and P. S. Yu Fast Computation of Rcachahiltiy1albeitngs in Large Graphs EDBT Conference 2 6. 61 EC. Cohen. Sizc-eslimalion framework with applications to transitive closure and reachability Journal of Computer and System Sciences Dec. 1997. 7 E. Cohcnt E Halpcrin. LL Kapian and th Zwick. Reachability and distance queriea via 2-hop labels ACM Symposium on Discrete AIgorithms 2 002. 8 I . Cook. L. Holdar. Mining Graph Data JohnWilty Sons Inc 21 07. D. Conte. P. I ocgia. C. Sansone and M. Vento. Thirty years of graph matching tin paltaan recognition. Ini. Journal of Pattern Recognition and Artificial Intelligence 18 3 265-298 2004. 10 Fil. ia i iiii. i P. I . C. Fatoutsos On Power Law Relationships of Lite Internet Topology. SIGCOMM Confierence 19999. 11 G. Liane R. Tarjan M. TaioutstoulikliSi Graph Clustering and Minimum Cun Trees Internet Mathematics 1 4 38 -1408 2003. 12 D. Gibson R. Kumac. A. Tomkins Discovering Large Dense Subgraphs in Massive Graphs CLDB Conference 2005. 13 M. Haya G. Mik au. I . .lenient Di Oowatcy. P. Weis. Resisting Structural Ra-iaicnlitication tn Social Networks. CLDB Conference 2008. 4 FL He. A. K. Sinaafi. Query Language and Access Methods loi Graoh Databases. In Proc of SIGMOD 08 p-tees 405-418 acaticoiic Ci Canada 2008. 15 H He. H. Wang. J. Yang. 2P. St Yu. BLINKS Ranked keyword searches on graphs. In hIGMOD 2007. 16 H. Kashima. K. Tonda. Ai Inokiichi. Mirginalized Kernels between La-Iteted Graphs 07L 2 103. 17 K i i l ti i C Dwork J. Kieinheig. Wherefore Art Thou R3579X Anonymized Sociat Nciwoiks. Hidden Patterns and Structural Steganog-raphy. S HW Conference 2 107. 18 T. KotiiOi E. Maeda. Y. Matsumoto. An Application of Boosting to Graph Classification MIPS Conf 2004. 19 Jt LeikI vcCl L Kleinloergi C. Lalouisos. Graph Evolution Densification and Shrinking Diameters. ACM Transactions on Knowledge Discovery from Data ACM
