{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,19]],"date-time":"2026-09-19T21:01:23Z","timestamp":1789851683970,"version":"4.0.1"},"reference-count":56,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2017,8]]},"abstract":"<jats:p>Large-scale, highly-interconnected networks pervade our society and the natural world around us, including the World Wide Web, social networks, knowledge graphs, genome and scientific databases, medical and government records. The massive scale of graph data often surpasses the available computation and storage resources. Besides, users get overwhelmed by the daunting task of understanding and using such graphs due to their sheer volume and complexity. Hence, there is a critical need to summarize large graphs into concise forms that can be more easily visualized, processed, and managed. Graph summarization has indeed attracted a lot of interests from various research communities, such as sociology, physics, chemistry, bioinformatics, and computer science. Different ways of summarizing graphs have been invented that are often complementary to each other. In this tutorial, we discuss algorithmic advances on graph summarization in the context of both classical (e.g., static graphs) and emerging (e.g., dynamic and stream graphs) applications. We emphasize the current challenges and highlight some future research directions.<\/jats:p>","DOI":"10.14778\/3137765.3137825","type":"journal-article","created":{"date-parts":[[2017,9,7]],"date-time":"2017-09-07T13:35:53Z","timestamp":1504791353000},"page":"1981-1984","source":"Crossref","is-referenced-by-count":29,"title":["Summarizing static and dynamic big graphs"],"prefix":"10.14778","volume":"10","author":[{"given":"Arijit","family":"Khan","sequence":"first","affiliation":[{"name":"Nanyang Technological University, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sourav S.","family":"Bhowmick","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francesco","family":"Bonchi","sequence":"additional","affiliation":[{"name":"ISI Foundation, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095156"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213560"},{"issue":"6009","key":"e_1_2_1_3_1","first-page":"1385","volume":"330","author":"Bandyopadhyay S.","unstructured":"S. Bandyopadhyay , M. Mehta , D. Kuo , M.-K. Sung , R. Chuang , E. J. Jaehnig , B. Bodenmiller , K. Licon , W. Copeland , M. Shales , D. Fiedler , J. Dutkowski , A. Gu\u00e9nol\u00e9 , H. van Attikum , K. M. Shokat , R. D. Kolodner , W.-K. Huh , R. Aebersold , M.-C. Keogh , N. J. Krogan , and T. Ideker , Rewiring of Genetic Networks in Response to DNA Damage., Science , 330 ( 6009 ), 1385 -- 1389 . S. Bandyopadhyay, M. Mehta, D. Kuo, M.-K. Sung, R. Chuang, E. J. Jaehnig, B. Bodenmiller, K. Licon, W. Copeland, M. Shales, D. Fiedler, J. Dutkowski, A. Gu\u00e9nol\u00e9, H. van Attikum, K. M. Shokat, R. D. Kolodner, W.-K. Huh, R. Aebersold, M.-C. Keogh, N. J. Krogan, and T. Ideker, Rewiring of Genetic Networks in Response to DNA Damage., Science, 330(6009), 1385--9.","journal-title":"Rewiring of Genetic Networks in Response to DNA Damage., Science"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963488"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03784-9_3"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341547"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687711"},{"key":"e_1_2_1_9_1","volume-title":"Mining Large Information Networks by Graph Summarization. Link Mining: Models, Algorithms, and Applications. (pp. 475--501)","author":"Chen C.","year":"2010","unstructured":"C. Chen , C. X. Lin , M. Fredrikson , M. Christodorescu , X. Yan , and J. Han , Mining Large Information Networks by Graph Summarization. Link Mining: Models, Algorithms, and Applications. (pp. 475--501) , Springer New York , 2010 . C. Chen, C. X. Lin, M. Fredrikson, M. Christodorescu, X. Yan, and J. Han, Mining Large Information Networks by Graph Summarization. Link Mining: Models, Algorithms, and Applications. (pp. 475--501), Springer New York, 2010."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.30"},{"key":"e_1_2_1_11_1","volume-title":"InfoNetOLAP: OLAP and Mining of Information Networks. Link Mining: Models, Algorithms, and Applications. (pp. 411--438)","author":"Chen C.","year":"2010","unstructured":"C. Chen , F. Zhu , X. Yan , J. Han , P. S. Yu , and R. Ramakrishnan , InfoNetOLAP: OLAP and Mining of Information Networks. Link Mining: Models, Algorithms, and Applications. (pp. 411--438) , Springer New York , 2010 . C. Chen, F. Zhu, X. Yan, J. Han, P. S. Yu, and R. Ramakrishnan, InfoNetOLAP: OLAP and Mining of Information Networks. Link Mining: Models, Algorithms, and Applications. (pp. 411--438), Springer New York, 2010."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557049"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173710"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1618595.1618605"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065201"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213855"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/070683155"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592799"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.26"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020580"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2016.7752224"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-017-0443-4"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-016-0388-y"},{"key":"e_1_2_1_24_1","volume-title":"SDM","author":"Koutra D.","year":"2017","unstructured":"D. Koutra , Summarizing Large-Scale Graph Data , SDM , 2017 . D. Koutra, Summarizing Large-Scale Graph Data, SDM, 2017."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1002\/sam.11267"},{"key":"e_1_2_1_26_1","volume-title":"CoRR, abs\/1612.04883","author":"Liu Y.","year":"2016","unstructured":"Y. Liu , A. Dighe , T. Safavi , and D. Koutra , A Graph Summarization: A Survey , CoRR, abs\/1612.04883 , 2016 . Y. Liu, A. Dighe, T. Safavi, and D. Koutra, A Graph Summarization: A Survey, CoRR, abs\/1612.04883, 2016."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.40"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2009.38"},{"key":"e_1_2_1_29_1","volume-title":"SDM","author":"Lin S.-D.","year":"2013","unstructured":"S.-D. Lin , M.-Y. Yeh , and C.-T. Li , Sampling and Summarization for Social Networks , SDM , 2013 . S.-D. Lin, M.-Y. Yeh, and C.-T. Li, Sampling and Summarization for Social Networks, SDM, 2013."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661862"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2627692.2627694"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835873"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.14"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376661"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623701"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44851-9_38"},{"key":"e_1_2_1_37_1","volume-title":"ICDE","author":"Raghavan S.","year":"2003","unstructured":"S. Raghavan and H. Garcia-Molina , Representing Web Graphs , ICDE , 2003 . S. Raghavan and H. Garcia-Molina, Representing Web Graphs, ICDE, 2003."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-016-0468-8"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2272604"},{"key":"e_1_2_1_40_1","first-page":"S10","volume":"13","author":"Seah B.-S.","year":"2012","unstructured":"B.-S. Seah , S. S. Bhowmick , C. F. Dewey Jr , and H. Yu , FUSE: A Profit Maximization Approach for Functional Summarization of Biological Networks, BMC Bioinformatics , 13(Suppl 3 ): S10 , 2012 . B.-S. Seah, S. S. Bhowmick, C. F. Dewey Jr, and H. Yu, FUSE: A Profit Maximization Approach for Functional Summarization of Biological Networks, BMC Bioinformatics, 13(Suppl 3):S10, 2012.","journal-title":"FUSE: A Profit Maximization Approach for Functional Summarization of Biological Networks, BMC Bioinformatics"},{"key":"e_1_2_1_41_1","volume-title":"Methods, 69(3)","author":"Seah B.-S.","year":"2014","unstructured":"B.-S. Seah , S. S. Bhowmick , and C. F. Dewey Jr , DiffNet: Automatic Differential Functional Summarization of dE-MAP Networks ., Methods, 69(3) , 2014 . B.-S. Seah, S. S. Bhowmick, and C. F. Dewey Jr, DiffNet: Automatic Differential Functional Summarization of dE-MAP Networks., Methods, 69(3), 2014."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783321"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.107"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498314"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915223"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2016.7840704"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376675"},{"key":"e_1_2_1_48_1","volume-title":"Interactive Graph Summarization. Link Mining: Models, Algorithms, and Applications. (pp. 389--410)","author":"Tian Y.","year":"2010","unstructured":"Y. Tian and J. M. Patel , Interactive Graph Summarization. Link Mining: Models, Algorithms, and Applications. (pp. 389--410) , Springer New York , 2010 . Y. Tian and J. M. Patel, Interactive Graph Summarization. Link Mining: Models, Algorithms, and Applications. (pp. 389--410), Springer New York, 2010."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020566"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939753"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556561"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447830"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113411"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.14778\/2078331.2078335"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989413"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.133"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3137765.3137825","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:08:55Z","timestamp":1672222135000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3137765.3137825"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":56,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["10.14778\/3137765.3137825"],"URL":"https:\/\/doi.org\/10.14778\/3137765.3137825","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2017,8]]}}}