{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T22:31:50Z","timestamp":1768429910446,"version":"3.49.0"},"publisher-location":"Cham","reference-count":162,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319494869","type":"print"},{"value":"9783319494876","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-49487-6_9","type":"book-chapter","created":{"date-parts":[[2016,11,10]],"date-time":"2016-11-10T14:11:38Z","timestamp":1478787098000},"page":"280-329","source":"Crossref","is-referenced-by-count":24,"title":["Clustering Evolving Networks"],"prefix":"10.1007","author":[{"given":"Tanja","family":"Hartmann","sequence":"first","affiliation":[]},{"given":"Andrea","family":"Kappes","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,11]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, M.K., Ramamritham, K., Bhide, M.: Real time discovery of dense clusters in highly dynamic graphs: identifying real world events in highly dynamic environments. In: Proceedings of the 38th International Conference on Very Large Databases (VLDB 2012), pp. 980\u2013991 (2012)","DOI":"10.14778\/2336664.2336671"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Subbian, K.: Evolutionary network analysis: a survey. ACM Comput. Surv. 47(10), 10:1\u201310:36 (2014)","DOI":"10.1145\/2601412"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Xie, Y., Yu, P.S.: Towards community detection in locally heterogeneous networks. In: Proceedings of the Fifth SIAM International Conference on Data Mining, pp. 391\u2013402. SIAM (2011)","DOI":"10.1137\/1.9781611972818.34"},{"issue":"6","key":"9_CR4","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1002\/sam.10090","volume":"3","author":"CC Aggarwal","year":"2010","unstructured":"Aggarwal, C.C., Zhao, Y., Yu, P.: A framework for clustering massive graph streams. Stat. Anal. Data Min. 3(6), 399\u2013416 (2010). http:\/\/dx.doi.org\/10.1002\/sam.10090","journal-title":"Stat. Anal. Data Min."},{"key":"9_CR5","doi-asserted-by":"crossref","first-page":"e24195","DOI":"10.1371\/journal.pone.0024195","volume":"6","author":"R Aldecoa","year":"2011","unstructured":"Aldecoa, R., Mar\u00edn, I.: Deciphering network community structure by surprise. PLoS ONE 6, e24195 (2011)","journal-title":"PLoS ONE"},{"key":"9_CR6","doi-asserted-by":"crossref","first-page":"026109","DOI":"10.1103\/PhysRevE.85.026109","volume":"85","author":"R Aldecoa","year":"2012","unstructured":"Aldecoa, R., Mar\u00edn, I.: Closed benchmarks for network community structure characterization. Phys. Rev. E 85, 026109 (2012). http:\/\/link.aps.org\/doi\/10.1103\/PhysRevE.85.026109","journal-title":"Phys. Rev. E"},{"key":"9_CR7","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0099421","volume-title":"\u00c9cole d\u2019\u00c9t\u00e9 de Probabilit\u00e9s de Saint-Flour XIII \u2014 1983","author":"DJ Aldous","year":"1985","unstructured":"Aldous, D.J.: Exchangeability and related topics. In: Hennequin, P.L. (ed.) \u00c9cole d\u2019\u00c9t\u00e9 de Probabilit\u00e9s de Saint-Flour XIII \u2014 1983. LNM, vol. 1117, pp. 1\u2013198. Springer, Heidelberg (1985). doi: 10.1007\/BFb0099421 . http:\/\/dx.doi.org\/10.1007\/BFb0099421"},{"key":"9_CR8","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0378-8733(92)90017-2","volume":"14","author":"CJ Anderson","year":"1992","unstructured":"Anderson, C.J., Wasserman, S., Faust, K.: Building stochastic blockmodels. Soc. Netw. 14, 137\u2013161 (1992)","journal-title":"Soc. Netw."},{"issue":"6","key":"9_CR9","doi-asserted-by":"crossref","first-page":"574","DOI":"10.14778\/2168651.2168658","volume":"5","author":"A Angel","year":"2012","unstructured":"Angel, A., Sarkas, N., Koudas, N., Srivastava, D.: Dense subgraph maintenance under streaming edge weight updates for real-time story identification. Proc. VLDB Endow. 5(6), 574\u2013585 (2012). http:\/\/dl.acm.org\/citation.cfm?id=2168651.2168658","journal-title":"Proc. VLDB Endow."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Arenas, A., Duch, J., Fernandez, A., Gomez, S.: Size reduction of complex networks preserving modularity. New J. Phys. 9(176) (2007). http:\/\/dx.doi.org\/10.1088\/1367-2630\/9\/6\/176","DOI":"10.1088\/1367-2630\/9\/6\/176"},{"issue":"4","key":"9_CR11","first-page":"16:1","volume":"3","author":"S Asur","year":"2009","unstructured":"Asur, S., Parthasarathy, S., Ucar, D.: An event-based framework for characterizing the evolutionary behavior of interaction graphs. ACM Trans. Knowl. Discovery Data 3(4), 16:1\u201316:36 (2009). http:\/\/doi.acm.org\/10.1145\/1631162.1631164","journal-title":"ACM Trans. Knowl. Discovery Data"},{"key":"9_CR12","series-title":"Modeling and Simulation in Science, Engineering and Technology","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/978-1-4614-6729-8_9","volume-title":"Dynamics on and of Complex Networks","author":"T Aynaud","year":"2013","unstructured":"Aynaud, T., Fleury, E., Guillaume, J.L., Wang, Q.: Communities in evolving networks definitions detection and analysis techniques. In: Mukherjee, A., Choudhury, M., Peruani, F., Ganguly, N., Mitra, B. (eds.) Dynamics on and of Complex Networks. Modeling and Simulation in Science, Engineering and Technology, vol. 2, pp. 159\u2013200. Springer, New York (2013). http:\/\/dx.doi.org\/10.1007\/978-1-4614-6729-8_9"},{"key":"9_CR13","unstructured":"Aynaud, T., Guillaume, J.L.: Static community detection algorithms for evolving networks. In: Proceedings of the 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt 2010), pp. 513\u2013519. IEEE Computer Society (2010)"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Backstrom, L., Huttenlocher, D., Kleinberg, J.M., Lan, X.: Group formation in large social networks: membership, growth, and evolution. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 44\u201354. ACM Press (2006). http:\/\/doi.acm.org\/10.1145\/1150402.1150412","DOI":"10.1145\/1150402.1150412"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Bagrow, J.: Evaluating local community methods in networks. J. Stat. Mech.: Theory Exp., P05001 (2008). http:\/\/www.iop.org\/EJ\/abstract\/1742-5468\/2008\/05\/P05001\/ , doi: 10.1088\/1742-5468\/2008\/05\/P05001","DOI":"10.1088\/1742-5468\/2008\/05\/P05001"},{"key":"9_CR16","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-25501-4_20","volume-title":"Complex Networks","author":"S Bansal","year":"2011","unstructured":"Bansal, S., Bhowmick, S., Paymal, P.: Fast community detection for dynamic complex networks. In: F. Costa, L., Evsukoff, A., Mangioni, G., Menezes, R. (eds.) CompleNet 2010. CCIS, vol. 116, pp. 196\u2013207. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-25501-4_20 . http:\/\/dx.doi.org\/10.1007\/978-3-642-25501-4_20"},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"9_CR18","unstructured":"Berger-Wolf, T., Kempe, D., Tantipathananandth, C.: A framework for community identification in dynamic social networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM Press (2007). http:\/\/compbio.cs.uic.edu\/~tanya\/research\/pubs\/TantipathananandhEtal_NetworkCommunities07.pdf"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Berger-Wolf, T., Saia, J.: A framework for analysis of dynamic social networks. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 523\u2013528. ACM Press (2006)","DOI":"10.1145\/1150402.1150462"},{"key":"9_CR20","volume-title":"Graph Partitioning","year":"2011","unstructured":"Bichot, C.E., Siarry, P. (eds.): Graph Partitioning. Wiley, Hoboken (2011). http:\/\/onlinelibrary.wiley.com\/book\/10.1002\/9781118601181"},{"key":"9_CR21","unstructured":"Bilgin, C.C., Yener, B.: Dynamic network evolution: models, clustering, anomaly detection. Technical report, Rensselaer University, NY (2008). http:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?rep=rep1&type=pdf&doi=10.1.1.161.6375"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Blondel, V., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. 2008(10) (2008). http:\/\/dx.doi.org\/10.1088\/1742-5468\/2008\/10\/P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Bogdanov, P., Mongiovi, M., Singh, A.K.: Mining heavy subgraphs in time-evolving networks. In: Proceedings of the 2011 IEEE International Conference on Data Mining, pp. 81\u201390. IEEE Computer Society (2011)","DOI":"10.1109\/ICDM.2011.101"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Borgwardt, K.M., Kriegel, H.P., Wackersreuther, P.: Pattern mining in frequent dynamic subgraphs. In: Proceedings of the 2006 IEEE International Conference on Data Mining, pp. 818\u2013822. IEEE Computer Society (2006)","DOI":"10.1109\/ICDM.2006.124"},{"issue":"2","key":"9_CR25","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1109\/TKDE.2007.190689","volume":"20","author":"U Brandes","year":"2008","unstructured":"Brandes, U., Delling, D., Gaertler, M., G\u00f6rke, R., H\u00f6fer, M., Nikoloski, Z., Wagner, D.: On modularity clustering. IEEE Trans. Knowl. Data Eng. 20(2), 172\u2013188 (2008). http:\/\/doi.ieeecomputersociety.org\/10.1109\/TKDE.2007.190689","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9_CR26","doi-asserted-by":"publisher","unstructured":"Brandes, U., Gaertler, M., Wagner, D.: Experiments on graph clustering algorithms. In: Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 568\u2013579. Springer, Heidelberg (2003). doi: 10.1007\/978-3-540-39658-1_52 , http:\/\/www.springerlink.com\/openurl.asp?genre=article&issn=0302-9743&volume=2832&spage=568","DOI":"10.1007\/978-3-540-39658-1_52"},{"issue":"1.1","key":"9_CR27","first-page":"1","volume":"12","author":"U Brandes","year":"2007","unstructured":"Brandes, U., Gaertler, M., Wagner, D.: Engineering graph clustering: models and experimental evaluation. ACM J. Exp. Algorithmics 12(1.1), 1\u201326 (2007). http:\/\/portal.acm.org\/citation.cfm?id=1227161.1227162","journal-title":"ACM J. Exp. Algorithmics"},{"issue":"9","key":"9_CR28","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.A.G.M.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Catalyurek, U., Boman, E., Devine, K., Bozdag, D., Heaphy, R., Riesen, L.A.: Hypergraph-based dynamic load balancing for adaptive scientific computations. In: 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), pp. 1\u201311. IEEE Computer Society (2007)","DOI":"10.1109\/IPDPS.2007.370258"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Cazabet, R., Amblard, F., Hanachi, C.: Detection of overlapping communities in dynamical social networks. In: Proceedings of the 2010 IEEE Second International Conference on Social Computing, pp. 309\u2013314. IEEE (2010)","DOI":"10.1109\/SocialCom.2010.51"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D.: AutoPart: parameter-free graph partitioning and outlier detection. In: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases, pp. 112\u2013124. ACM Press (2004)","DOI":"10.1007\/978-3-540-30116-5_13"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Kumar, R., Tomkins, A.S.: Evolutionary clustering. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 554\u2013560. ACM Press (2006). http:\/\/doi.acm.org\/10.1145\/1150402.1150467","DOI":"10.1145\/1150402.1150467"},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"Chen, J., Fagnan, J., Goebel, R., Rabbany, R., Sangi, F., Takaffoli, M., Verbeek, E., Za\u00efane, O.R.: Meerkat: community mining with dynamic social networks. In: Proceedings in the 10th IEEE International Conference on Data Mining - Workshops, pp. 1377\u20131380. IEEE Computer Society, December 2010","DOI":"10.1109\/ICDMW.2010.40"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Chen, J., Za\u00efane, O.R., Goebel, R.: Detecting communities in large networks by iterative local expansion. In: Proceedings of the 2009 IEEE International Conference on Computational Aspects of Social Networks, pp. 105\u2013112. IEEE Computer Society (2009)","DOI":"10.1109\/CASoN.2009.29"},{"key":"9_CR35","doi-asserted-by":"crossref","unstructured":"Chi, Y., Song, X., Zhou, D., Hino, K., Tseng, B.L.: Evolutionary spectral clustering by incorporating temporal smoothness. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 153\u2013162. ACM Press (2007). http:\/\/doi.acm.org\/10.1145\/1281192.1281212","DOI":"10.1145\/1281192.1281212"},{"issue":"2","key":"9_CR36","doi-asserted-by":"crossref","first-page":"026132","DOI":"10.1103\/PhysRevE.72.026132","volume":"72","author":"A Clauset","year":"2005","unstructured":"Clauset, A.: Finding local community structure in networks. Phys. Rev. E 72(2), 026132 (2005). http:\/\/link.aps.org\/doi\/10.1103\/PhysRevE.72.026132","journal-title":"Phys. Rev. E"},{"key":"9_CR37","doi-asserted-by":"crossref","unstructured":"Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70(066111) (2004). http:\/\/link.aps.org\/abstract\/PRE\/v70\/e066111","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"9_CR38","doi-asserted-by":"crossref","unstructured":"Condon, A., Karp, R.M.: Algorithms for graph partitioning on the planted partition model. Randoms Struct. Algorithms 18(2), 116\u2013140 (2001). http:\/\/dx.doi.org\/10.1002\/1098-2418(200103)18:2<116::AID-RSA1001>3.0.CO;2-2","DOI":"10.1002\/1098-2418(200103)18:2<116::AID-RSA1001>3.0.CO;2-2"},{"issue":"2","key":"9_CR39","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0743-7315(89)90021-X","volume":"7","author":"G Cybenko","year":"1989","unstructured":"Cybenko, G.: Dynamic load balancing for distributed memory multiprocessors. J. Parallel Distrib. Comput. 7(2), 279\u2013301 (1989). http:\/\/dx.doi.org\/10.1016\/0743-7315(89)90021-X","journal-title":"J. Parallel Distrib. Comput."},{"key":"9_CR40","volume-title":"Deep South","author":"A Davis","year":"1941","unstructured":"Davis, A., Gardner, B., Gardner, M.R.: Deep South. University of Chicago Press, Chicago (1941)"},{"key":"9_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-540-68880-8_14","volume-title":"Algorithmic Aspects in Information and Management","author":"D Delling","year":"2008","unstructured":"Delling, D., Gaertler, M., G\u00f6rke, R., Wagner, D.: Engineering comparators for graph clusterings. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol. 5034, pp. 131\u2013142. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-68880-8_14"},{"key":"9_CR42","doi-asserted-by":"crossref","first-page":"160202","DOI":"10.1103\/PhysRevLett.94.160202","volume":"94","author":"I Der\u00e9nyi","year":"2005","unstructured":"Der\u00e9nyi, I., Palla, G., Vicsek, T.: Clique percolation in random networks. Phys. Rev. Lett. 94, 160202 (2005). http:\/\/link.aps.org\/abstract\/PRL\/v94\/e160202","journal-title":"Phys. Rev. Lett."},{"key":"9_CR43","doi-asserted-by":"crossref","unstructured":"Ding, C.H.Q., He, X., Zha, H., Gu, M., Simon, H.D.: A min-max cut algorithm for graph partitioning and data clustering. In: Proceedings of the 2001 IEEE International Conference on Data Mining, pp. 107\u2013114. IEEE Computer Society (2001). http:\/\/dx.doi.org\/10.1109\/ICDM.2001.989507","DOI":"10.1109\/ICDM.2001.989507"},{"key":"9_CR44","doi-asserted-by":"crossref","unstructured":"Dinh, T.N., Nguyen, N.P., Thai, M.T.: An adaptive approximation algorithm for community detection in dynamic scale-free networks. In: Proceedings of the 32th Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom). IEEE Computer Society Press (2013, to appear)","DOI":"10.1109\/INFCOM.2013.6566734"},{"key":"9_CR45","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/978-1-4419-5689-7_4","volume-title":"Dynamics of Information Systems","author":"TN Dinh","year":"2010","unstructured":"Dinh, T.N., Shin, I., Thai, N.K., Thai, M.T., Znati, T.: A general approach for modules identification in evolving networks. In: Hirsch, M.J., Pardalos, P.M., Murphey, R. (eds.) Dynamics of Information Systems. Springer Optimization and Its Applications, vol. 40, pp. 83\u2013100. Springer, New York (2010). http:\/\/dx.doi.org\/10.1007\/978-1-4419-5689-7_4"},{"issue":"6","key":"9_CR46","doi-asserted-by":"crossref","first-page":"997","DOI":"10.1109\/JSAC.2013.130602","volume":"31","author":"TN Dinh","year":"2013","unstructured":"Dinh, T.N., Thai, M.T.: Community detection in scale-free networks: approximation algorithms for maximizing modularity. IEEE J. Sel. Areas Commun. 31(6), 997\u20131006 (2013)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"9_CR47","doi-asserted-by":"crossref","unstructured":"Dinh, T.N., Ying, X., Thai, M.T.: Towards social-aware routing in dynamic communication networks. In: Proceedings of the 28th International Performance Computing and Communications Conference (IPCCC), pp. 161\u2013168 (2009)","DOI":"10.1109\/PCCC.2009.5403845"},{"key":"9_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-642-22300-6_29","volume-title":"Algorithms and Data Structures","author":"C Doll","year":"2011","unstructured":"Doll, C., Hartmann, T., Wagner, D.: Fully-dynamic hierarchical graph clustering using cut trees. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol. 6844, pp. 338\u2013349. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-22300-6_29"},{"issue":"2","key":"9_CR49","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s10462-011-9250-x","volume":"38","author":"D Duan","year":"2012","unstructured":"Duan, D., Li, Y., Li, R., Lu, Z.: Incremental k-clique clustering in dynamic social networks. Artif. Intell. 38(2), 129\u2013147 (2012)","journal-title":"Artif. Intell."},{"issue":"4","key":"9_CR50","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00779-005-0046-3","volume":"10","author":"N Eagle","year":"2006","unstructured":"Eagle, N., Pentland, A.: Reality mining: sensing complex social systems. J. Pers. Ubiquit. Comput. 10(4), 255\u2013268 (2006)","journal-title":"J. Pers. Ubiquit. Comput."},{"key":"9_CR51","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the 2nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 226\u2013231. ACM Press (1996)"},{"issue":"1","key":"9_CR52","first-page":"49","volume":"21","author":"MG Everett","year":"1998","unstructured":"Everett, M.G., Borgatti, S.P.: Analyzing clique overlap. Connections 21(1), 49\u201361 (1998)","journal-title":"Connections"},{"key":"9_CR53","unstructured":"Falkowski, T.: Community analysis in dynamic social networks. Ph.D. thesis, Otto-von-Guericke-Universit\u00e4t Magdeburg (2009)"},{"key":"9_CR54","doi-asserted-by":"crossref","unstructured":"Falkowski, T., Bartelheimer, J., Spiliopoulou, M.: Mining and visualizing the evolution of subgroups in social networks. In: IEEE\/WIC\/ACM International Conference on Web Intelligence, pp. 52\u201358. IEEE (2006)","DOI":"10.1109\/WI.2006.118"},{"key":"9_CR55","doi-asserted-by":"crossref","unstructured":"Falkowski, T., Barth, A., Spiliopoulou, M.: Dengraph: A density-based community detection algorithm. In: IEEE\/WIC\/ACM International Conference on Web Intelligence, pp. 112\u2013115. IEEE (2007)","DOI":"10.1109\/WI.2007.74"},{"issue":"1","key":"9_CR56","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/j.physa.2006.11.036","volume":"377","author":"Y Fan","year":"2007","unstructured":"Fan, Y., Li, M., Zhang, P., Wu, J., Di, Z.: Accuracy and precision of methods for community identification in weighted networks. Phys. A 377(1), 363\u2013372 (2007). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0378437106012386","journal-title":"Phys. A"},{"issue":"4","key":"9_CR57","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1080\/15427951.2004.10129093","volume":"1","author":"GW Flake","year":"2004","unstructured":"Flake, G.W., Tarjan, R.E., Tsioutsiouliklis, K.: Graph clustering and minimum cut trees. Internet Math. 1(4), 385\u2013408 (2004). http:\/\/www.internetmathematics.org\/volumes\/1.htm","journal-title":"Internet Math."},{"issue":"3\u20135","key":"9_CR58","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3\u20135), 75\u2013174 (2010). http:\/\/www.sciencedirect.com\/science\/journal\/03701573","journal-title":"Phys. Rep."},{"issue":"1","key":"9_CR59","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"S Fortunato","year":"2007","unstructured":"Fortunato, S., Barth\u00e9lemy, M.: Resolution limit in community detection. Proc. Natl. Acad. Sci. U.S.A. 104(1), 36\u201341 (2007). http:\/\/www.pnas.org\/content\/104\/1\/36.full.pdf","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"9_CR60","doi-asserted-by":"publisher","unstructured":"Gaertler, M., G\u00f6rke, R., Wagner, D.: Significance-driven graph clustering. In: Kao, M.-Y., Li, X.-Y. (eds.) AAIM 2007. LNCS, vol. 4508, pp. 11\u201326. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-72870-2_2 , http:\/\/www.springerlink.com\/content\/nrq6tlm286808887\/?p=65f77ccbb2674a16b9a67da6bb370dc7&pi=5","DOI":"10.1007\/978-3-540-72870-2_2"},{"key":"9_CR61","doi-asserted-by":"crossref","unstructured":"Gehweiler, J., Meyerhenke, H.: A distributed diffusive heuristic for clustering a virtual P2P supercomputer. In: Proceedings of the 7th High-Performance Grid Computing Workshop (HGCW 2010) in Conjunction with 24th International Parallel and Distributed Processing Symposium (IPDPS 2010), pp. 1\u20138. IEEE Computer Society (2010)","DOI":"10.1109\/IPDPSW.2010.5470922"},{"issue":"4","key":"9_CR62","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"H Gilbert","year":"1959","unstructured":"Gilbert, H.: Random graphs. Ann. Math. Stat. 30(4), 1141\u20131144 (1959)","journal-title":"Ann. Math. Stat."},{"issue":"12","key":"9_CR63","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. U.S.A. 99(12), 7821\u20137826 (2002)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"9_CR64","unstructured":"Gloor, P.A., Zhao, Y.: TeCFlow - a temporal communication flow visualizer for social network analysis. In: ACM CSCW Workshop on Social Networks (2004)"},{"issue":"4","key":"9_CR65","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"RE Gomory","year":"1961","unstructured":"Gomory, R.E., Hu, T.: Multi-terminal network flows. J. Soc. Ind. Appl. Math. 9(4), 551\u2013570 (1961)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"9_CR66","unstructured":"G\u00f6rke, R.: An algorithmic walk from static to dynamic graph clustering. Ph.D. thesis, Fakult\u00e4t f\u00fcr Informatik, February 2010. http:\/\/digbib.ubka.uni-karlsruhe.de\/volltexte\/1000018288"},{"key":"9_CR67","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-03367-4_30","volume-title":"Algorithms and Data Structures","author":"R G\u00f6rke","year":"2009","unstructured":"G\u00f6rke, R., Hartmann, T., Wagner, D.: Dynamic graph clustering using minimum-cut trees. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol. 5664, pp. 339\u2013350. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-03367-4_30 . http:\/\/dx.doi.org\/10.1007\/978-3-642-03367-4_30"},{"issue":"2","key":"9_CR68","doi-asserted-by":"crossref","first-page":"411","DOI":"10.7155\/jgaa.00269","volume":"16","author":"R G\u00f6rke","year":"2012","unstructured":"G\u00f6rke, R., Hartmann, T., Wagner, D.: Dynamic graph clustering using minimum-cut trees. J. Graph Algorithms Appl. 16(2), 411\u2013446 (2012)","journal-title":"J. Graph Algorithms Appl."},{"key":"9_CR69","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-34862-4_16","volume-title":"Design and Analysis of Algorithms","author":"R G\u00f6rke","year":"2012","unstructured":"G\u00f6rke, R., Kluge, R., Schumm, A., Staudt, C., Wagner, D.: An efficient generator for clustered dynamic random networks. In: Even, G., Rawitz, D. (eds.) MedAlg 2012. LNCS, vol. 7659, pp. 219\u2013233. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-34862-4_16"},{"issue":"1","key":"9_CR70","first-page":"1.5:1.1","volume":"18","author":"R G\u00f6rke","year":"2013","unstructured":"G\u00f6rke, R., Maillard, P., Schumm, A., Staudt, C., Wagner, D.: Dynamic graph clustering combining modularity and smoothness. ACM J. Exp. Algorithmics 18(1), 1.5:1.1\u20131.5:1.29 (2013). http:\/\/dl.acm.org\/citation.cfm?doid=2444016.2444021","journal-title":"ACM J. Exp. Algorithmics"},{"key":"9_CR71","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/978-3-642-22300-6_58","volume-title":"Algorithms and Data Structures","author":"R G\u00f6rke","year":"2011","unstructured":"G\u00f6rke, R., Schumm, A., Wagner, D.: Density-constrained graph clustering. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol. 6844, pp. 679\u2013690. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-22300-6_58 . http:\/\/link.springer.com\/chapter\/10.1007\/978-3-642-22300-6_58?null"},{"key":"9_CR72","unstructured":"G\u00f6rke, R., Staudt, C.: A generator for dynamic clustered random graphs. Technical report, ITI Wagner, Faculty of Informatics, Universit\u00e4t Karlsruhe (TH) (2009). http:\/\/i11www.iti.uni-karlsruhe.de\/projects\/spp1307\/dyngen , informatik, Uni Karlsruhe, TR 2009-7"},{"issue":"3","key":"9_CR73","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TPAMI.2006.57","volume":"28","author":"L Grady","year":"2006","unstructured":"Grady, L., Schwartz, E.I.: Isoperimetric graph partitioning for image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 28(3), 469\u2013475 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9_CR74","doi-asserted-by":"crossref","unstructured":"Greene, D., Doyle, D., Cunningham, P.: Tracking the evolution of communities in dynamic social networks. In: Proceedings of the 2010 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 176\u2013183. IEEE Computer Society (2010)","DOI":"10.1109\/ASONAM.2010.17"},{"key":"9_CR75","doi-asserted-by":"crossref","first-page":"036102","DOI":"10.1103\/PhysRevE.76.036102","volume":"76","author":"R Guimer\u00e0","year":"2007","unstructured":"Guimer\u00e0, R., Sales-Pardo, M., Amaral, L.A.N.: Module identification in bipartite and directed networks. Phys. Rev. E 76, 036102 (2007). http:\/\/link.aps.org\/doi\/10.1103\/PhysRevE.76.036102","journal-title":"Phys. Rev. E"},{"key":"9_CR76","doi-asserted-by":"crossref","unstructured":"Held, P., Kruse, R.: Analysis and visualization of dynamic clusterings. In: Proceedings of the 46th Hawaii International Conference on System Sciences, pp. 1385\u20131393 (2013)","DOI":"10.1109\/HICSS.2013.93"},{"key":"9_CR77","doi-asserted-by":"crossref","first-page":"5244","DOI":"10.1073\/pnas.0307750100","volume":"101","author":"JE Hopcroft","year":"2004","unstructured":"Hopcroft, J.E., Khan, O., Kulis, B., Selman, B.: Tracking evolving communities in large linked networks. Proc. Natl. Acad. Sci. U.S.A. 101, 5244\u20135253 (2004). http:\/\/www.pnas.org\/content\/101\/suppl.1\/5249.abstract","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"issue":"2","key":"9_CR78","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1111\/j.1469-8137.1912.tb05611.x","volume":"11","author":"P Jaccard","year":"1912","unstructured":"Jaccard, P.: The distribution of flora in the alpine zone. New Phytol. 11(2), 37\u201350 (1912)","journal-title":"New Phytol."},{"issue":"3","key":"9_CR79","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1145\/990308.990313","volume":"51","author":"R Kannan","year":"2004","unstructured":"Kannan, R., Vempala, S., Vetta, A.: On clusterings: good, bad, spectral. J. ACM 51(3), 497\u2013515 (2004)","journal-title":"J. ACM"},{"key":"9_CR80","doi-asserted-by":"crossref","unstructured":"Kim, K., McKay, R.I., Moon, B.R.: Multiobjective evolutionary algorithms for dynamic social network clustering. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, pp. 1179\u20131186. ACM Press (2010)","DOI":"10.1145\/1830483.1830699"},{"key":"9_CR81","doi-asserted-by":"crossref","unstructured":"Kim, M.S., Han, J.: A particle-and-density based evolutionary clustering method for dynamic networks. In: Proceedings of the 35th International Conference on Very Large Databases (VLDB 2009), pp. 622\u2013633 (2009)","DOI":"10.14778\/1687627.1687698"},{"issue":"1","key":"9_CR82","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1214\/aoms\/1177729694","volume":"22","author":"S Kullback","year":"1951","unstructured":"Kullback, S., Leibler, R.A.: On information and sufficiency. Ann. Math. Stat. 22(1), 79\u201386 (1951)","journal-title":"Ann. Math. Stat."},{"key":"9_CR83","doi-asserted-by":"crossref","unstructured":"Kumar, R., Novak, J., Tomkins, A.S.: Structure and evolution of online social networks. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 611\u2013617. ACM Press (2006). http:\/\/doi.acm.org\/10.1145\/1150402.1150476","DOI":"10.1145\/1150402.1150476"},{"key":"9_CR84","doi-asserted-by":"crossref","unstructured":"Lai, J.H., Wang, C.D., Yu, P.: Dynamic community detection in weighted graph streams. In: Proceedings of the 2013 SIAM International Conference on Data Mining, pp. 151\u2013161. SIAM (2013)","DOI":"10.1137\/1.9781611972832.17"},{"issue":"1","key":"9_CR85","doi-asserted-by":"crossref","first-page":"016118","DOI":"10.1103\/PhysRevE.80.016118","volume":"80","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti, A., Fortunato, S.: Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys. Rev. E 80(1), 016118 (2009)","journal-title":"Phys. Rev. E"},{"key":"9_CR86","doi-asserted-by":"crossref","unstructured":"Lancichinetti, A., Fortunato, S., Kert\u00e9sz, J.: Detecting the overlapping and hierarchical community structure of complex networks. New J. Phys. 11(033015) (2009). http:\/\/www.iop.org\/EJ\/njp","DOI":"10.1088\/1367-2630\/11\/3\/033015"},{"issue":"4","key":"9_CR87","doi-asserted-by":"crossref","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. E 78(4), 046110 (2008)","journal-title":"Phys. Rev. E"},{"key":"9_CR88","unstructured":"Lee, C., Cunningham, P.: Benchmarking community detection methods on social media data. Preprint, arXiv:1302.0739 [cs.SI] (2013)"},{"issue":"11","key":"9_CR89","doi-asserted-by":"crossref","first-page":"118703+","DOI":"10.1103\/PhysRevLett.100.118703","volume":"100","author":"EA Leicht","year":"2008","unstructured":"Leicht, E.A., Newman, M.E.J.: Community structure in directed networks. Phys. Rev. Lett. 100(11), 118703+ (2008). http:\/\/dx.doi.org\/10.1103\/PhysRevLett.100.118703","journal-title":"Phys. Rev. Lett."},{"issue":"6","key":"9_CR90","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"FT Leighton","year":"1999","unstructured":"Leighton, F.T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46(6), 787\u2013832 (1999). http:\/\/portal.acm.org\/citation.cfm?doid=331524.331526","journal-title":"J. ACM"},{"key":"9_CR91","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Backstrom, L., Kumar, R., Tomkins, A.S.: Microscopic evolution of social networks. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 462\u2013470. ACM Press (2008)","DOI":"10.1145\/1401890.1401948"},{"key":"9_CR92","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J.M., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 177\u2013187. ACM Press (2005). http:\/\/portal.acm.org\/citation.cfm?id=1081893","DOI":"10.1145\/1081870.1081893"},{"issue":"2","key":"9_CR93","first-page":"8:1","volume":"3","author":"YR Lin","year":"2009","unstructured":"Lin, Y.R., Chi, Y., Zhu, S., Sundaram, H., Tseng, B.L.: Analyzing communities and their evolutions in dynamic social networks. ACM Trans. Knowl. Discov. Data 3(2), 8:1\u20138:31 (2009)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"9_CR94","unstructured":"Luo, F., Wang, J.Z., Promislow, E.: Exploring local community structures in large networks. In: IEEE\/WIC\/ACM International Conference on Web Intelligence, pp. 233\u2013239. IEEE (2006). http:\/\/ieeexplore.ieee.org\/xpl\/articleDetails.jsp?arnumber=4061371"},{"issue":"4","key":"9_CR95","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Luxburg von","year":"2007","unstructured":"von Luxburg, U.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395\u2013416 (2007). http:\/\/www.springerlink.com\/content\/jq1g17785n783661\/","journal-title":"Stat. Comput."},{"key":"9_CR96","doi-asserted-by":"crossref","unstructured":"Meyerhenke, H.: Dynamic load balancing for parallel numerical simulations based on repartitioning with disturbed diffusion. In: 15th International Conference on Parallel and Distributed Systems (ICPADS), pp. 150\u2013157. IEEE (2009)","DOI":"10.1109\/ICPADS.2009.114"},{"issue":"9","key":"9_CR97","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1016\/j.jpdc.2009.04.005","volume":"69","author":"H Meyerhenke","year":"2009","unstructured":"Meyerhenke, H., Monien, B., Sauerwald, T.: A new diffusion-based multilevel algorithm for computing graph partitions. J. Parallel Distrib. Comput. 69(9), 750\u2013761 (2009). http:\/\/dx.doi.org\/10.1016\/j.jpdc.2009.04.005","journal-title":"J. Parallel Distrib. Comput."},{"issue":"10\u201311","key":"9_CR98","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1016\/j.parco.2009.09.006","volume":"35","author":"H Meyerhenke","year":"2009","unstructured":"Meyerhenke, H., Monien, B., Schamberger, S.: Graph partitioning and disturbed diffusion. Parallel Comput. 35(10\u201311), 544\u2013569 (2009). http:\/\/dx.doi.org\/10.1016\/j.parco.2009.09.006","journal-title":"Parallel Comput."},{"issue":"2","key":"9_CR99","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1198\/000313001750358428","volume":"55","author":"B Mirkin","year":"2001","unstructured":"Mirkin, B.: Eleven ways to look at the chi-squared coefficient for contingency tables. Am. Stat. 55(2), 111\u2013120 (2001). http:\/\/www.jstor.org\/stable\/2685997","journal-title":"Am. Stat."},{"issue":"2","key":"9_CR100","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","volume":"6","author":"K Misue","year":"1995","unstructured":"Misue, K., Eades, P., Lai, W., Sugiyama, K.: Layout adjustment and the mental map. J. Vis. Lang. Comput. 6(2), 183\u2013210 (1995). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1045926X85710105","journal-title":"J. Vis. Lang. Comput."},{"issue":"4","key":"9_CR101","doi-asserted-by":"crossref","first-page":"1206","DOI":"10.1086\/421509","volume":"110","author":"J Moody","year":"2005","unstructured":"Moody, J., McFarland, D., Bender-deMoll, S.: Dynamic network visualization. Am. J. Sociol. 110(4), 1206\u20131241 (2005)","journal-title":"Am. J. Sociol."},{"issue":"6","key":"9_CR102","doi-asserted-by":"crossref","first-page":"1301","DOI":"10.1109\/TVCG.2008.158","volume":"14","author":"C Muelder","year":"2008","unstructured":"Muelder, C., Ma, K.L.: Rapid graph layout using space filling curves. IEEE Trans. Vis. Comput. Graph. 14(6), 1301\u20131308 (2008)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"9_CR103","doi-asserted-by":"crossref","unstructured":"Muelder, C., Ma, K.L.: A treemap based method for rapid layout of large graphs. In: Proceedings of IEEE Pacific Visualization Symposium (PacificVis 2008), pp. 231\u2013238 (2008)","DOI":"10.1109\/PACIFICVIS.2008.4475481"},{"issue":"2","key":"9_CR104","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45(2), 167\u2013256 (2003). http:\/\/dx.doi.org\/10.1137\/S003614450342480","journal-title":"SIAM Rev."},{"issue":"056131","key":"9_CR105","first-page":"1","volume":"70","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J.: Analysis of weighted networks. Phys. Rev. E 70(056131), 1\u20139 (2004). http:\/\/link.aps.org\/abstract\/PRE\/v70\/e056131","journal-title":"Phys. Rev. E"},{"issue":"2","key":"9_CR106","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1140\/epjb\/e2004-00124-y","volume":"38","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J.: Detecting community structure in networks. Eur. Phys. J. B 38(2), 321\u2013330 (2004). http:\/\/www.springerlink.com\/content\/5GTDACX17BQV6CDC","journal-title":"Eur. Phys. J. B"},{"issue":"026113","key":"9_CR107","first-page":"1","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(026113), 1\u201316 (2004). http:\/\/link.aps.org\/abstract\/PRE\/v69\/e026113","journal-title":"Phys. Rev. E"},{"key":"9_CR108","doi-asserted-by":"crossref","unstructured":"Nguyen, N.P., Dinh, T.N., Ying, X., Thai, M.T.: Adaptive algorithms for detecting community structure in dynamic social networks. In: Proceedings of the 30th Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom), pp. 2282\u20132290. IEEE Computer Society Press (2011)","DOI":"10.1109\/INFCOM.2011.5935045"},{"key":"9_CR109","unstructured":"Nicosia, V., Mangioni, G., Carchiolo, V., Malgeri, M.: Extending the definition of modularity to directed graphs with overlapping communities. J. Stat. Mech.: Theory Exp. 2009(03), p03024 (23pp) (2009). http:\/\/stacks.iop.org\/1742-5468\/2009\/P03024"},{"key":"9_CR110","doi-asserted-by":"crossref","unstructured":"Ning, H., Xu, W., Chi, Y., Gong, Y., Huang, T.: Incremental spectral clustering with application to monitoring of evolving blog communities. In: Proceedings of the 2007 SIAM International Conference on Data Mining, pp. 261\u2013272. SIAM (2007)","DOI":"10.1137\/1.9781611972771.24"},{"key":"9_CR111","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.patcog.2009.06.001","volume":"43","author":"H Ning","year":"2010","unstructured":"Ning, H., Xu, W., Chi, Y., Gong, Y., Huang, T.: Incremental spectral clustering by efficiently updating the eigen-system. Pattern Recogn. 43, 113\u2013127 (2010)","journal-title":"Pattern Recogn."},{"key":"9_CR112","unstructured":"Ovelg\u00f6nne, M., Geyer-Schulz, A.: An ensemble learning strategy for graph clustering. In: Graph Partitioning and Graph Clustering: Tenth DIMACS Implementation Challenge. DIMACS Book, vol. 588, pp. 187\u2013206. American Mathematical Society (2013). http:\/\/www.ams.org\/books\/conm\/588\/11701"},{"key":"9_CR113","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1038\/nature05670","volume":"446","author":"G Palla","year":"2007","unstructured":"Palla, G., Barab\u00e1si, A.L., Vicsek, T.: Quantifying social group evolution. Nature 446, 664\u2013667 (2007). http:\/\/www.nature.com\/nature\/journal\/v446\/n7136\/abs\/nature05670.html","journal-title":"Nature"},{"key":"9_CR114","doi-asserted-by":"crossref","unstructured":"Pang, S., Chen, C., Wei, T.: A realtime community detection algorithm: incremental label propagation. In: First International Conference on Future Information Networks (ICFIN 2009), pp. 313\u2013317. IEEE (2009)","DOI":"10.1109\/ICFIN.2009.5339592"},{"key":"9_CR115","unstructured":"Park, Y., Song, M.: A genetic algorithm for clustering problems. In: Proceedings of the 3rd Annual Conference on Genetic Programming, pp. 568\u2013575 (1998)"},{"key":"9_CR116","doi-asserted-by":"crossref","unstructured":"Patro, R., Duggal, G., Sefer, E., Wang, H., Filippova, D., Kingsford, C.: The missing models: a data-driven approach for learning how networks grow. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 42\u201350. ACM Press (2012)","DOI":"10.1145\/2339530.2339541"},{"issue":"302","key":"9_CR117","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1080\/14786440009463897","volume":"50","author":"K Pearson","year":"1900","unstructured":"Pearson, K.: On the criterion that a given system of deviations from the probable in the case of a correlated system of variables is such that it can be reasonably supposed to have arisen from random sampling. Philos. Mag. Ser. 5 50(302), 157\u2013175 (1900)","journal-title":"Philos. Mag. Ser. 5"},{"issue":"2","key":"9_CR118","doi-asserted-by":"crossref","first-page":"191","DOI":"10.7155\/jgaa.00124","volume":"10","author":"P Pons","year":"2006","unstructured":"Pons, P., Latapy, M.: Computing communities in large networks using random walks. J. Graph Algorithms Appl. 10(2), 191\u2013218 (2006). http:\/\/www.cs.brown.edu\/publications\/jgaa\/","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"9_CR119","doi-asserted-by":"crossref","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76(3), 036106 (2007). http:\/\/link.aps.org\/doi\/10.1103\/PhysRevE.76.036106","journal-title":"Phys. Rev. E"},{"issue":"336","key":"9_CR120","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"WM Rand","year":"1971","unstructured":"Rand, W.M.: Objective criteria for the evaluation of clustering methods. J. Am. Stat. Assoc. 66(336), 846\u2013850 (1971). http:\/\/www.jstor.org\/stable\/2284239?origin=crossref","journal-title":"J. Am. Stat. Assoc."},{"key":"9_CR121","doi-asserted-by":"crossref","unstructured":"Riedy, J., Bader, D.A.: Multithreaded community monitoring for massive streaming graph data. In: Workshop on Multithreaded Architectures and Applications (MTAAP 2013) (2013, to appear)","DOI":"10.1109\/IPDPSW.2013.229"},{"key":"9_CR122","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-642-31464-3_29","volume-title":"Parallel Processing and Applied Mathematics","author":"EJ Riedy","year":"2012","unstructured":"Riedy, E.J., Meyerhenke, H., Ediger, D., Bader, D.A.: Parallel community detection for massive graphs. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wa\u015bniewski, J. (eds.) PPAM 2011. LNCS, vol. 7203, pp. 286\u2013296. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-31464-3_29 . http:\/\/dx.doi.org\/10.1007\/978-3-642-31464-3_29"},{"issue":"5","key":"9_CR123","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J Rissanen","year":"1978","unstructured":"Rissanen, J.: Modeling by shortest data description. Automatica 14(5), 465\u2013471 (1978)","journal-title":"Automatica"},{"key":"9_CR124","doi-asserted-by":"crossref","first-page":"2.3:2.1","DOI":"10.1145\/1963190.1970376","volume":"16","author":"R Rotta","year":"2011","unstructured":"Rotta, R., Noack, A.: Multilevel local search algorithms for modularity clustering. ACM J. Exp. Algorithmics 16, 2.3:2.1\u20132.3:2.27 (2011). http:\/\/doi.acm.org\/10.1145\/1963190.1970376","journal-title":"ACM J. Exp. Algorithmics"},{"key":"9_CR125","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","volume":"20","author":"PJ Rousseeuw","year":"1987","unstructured":"Rousseeuw, P.J.: Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J. Comput. Appl. Math. 20, 53\u201365 (1987). http:\/\/www.sciencedirect.com\/science\/article\/pii\/0377042787901257","journal-title":"J. Comput. Appl. Math."},{"key":"9_CR126","doi-asserted-by":"crossref","unstructured":"Saha, B., Mitra, P.: Dynamic algorithm for graph clustering using minimum cut tree. In: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops, pp. 667\u2013671. IEEE Computer Society, December 2006. http:\/\/ieeexplore.ieee.org\/xpls\/abs_all.jsp?arnumber=4063709","DOI":"10.1109\/ICDMW.2006.65"},{"key":"9_CR127","unstructured":"Saha, B., Mitra, P.: Dynamic algorithm for graph clustering using minimum cut tree. In: Proceedings of the 2007 SIAM International Conference on Data Mining, pp. 581\u2013586. SIAM (2007). http:\/\/www.siam.org\/proceedings\/datamining\/2007\/dm07.php"},{"key":"9_CR128","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-642-36763-2_43","volume-title":"Graph Drawing","author":"A Sallaberry","year":"2013","unstructured":"Sallaberry, A., Muelder, C., Ma, K.-L.: Clustering, visualizing, and navigating for large dynamic graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 487\u2013498. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-36763-2_43 . http:\/\/dx.doi.org\/10.1007\/978-3-642-36763-2_43"},{"key":"9_CR129","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1140\/epjb\/e2008-00418-0","volume":"67","author":"EN Sawardecker","year":"2009","unstructured":"Sawardecker, E.N., Sales-Pardo, M., Amaral, L.A.N.: Detection of node group membership in networks with group overlap. Eur. Phys. J. B 67, 277\u2013284 (2009). http:\/\/dx.doi.org\/10.1140\/epjb\/e2008-00418-0","journal-title":"Eur. Phys. J. B"},{"issue":"1","key":"9_CR130","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"SE Schaeffer","year":"2007","unstructured":"Schaeffer, S.E.: Graph clustering. Comput. Sci. Rev. 1(1), 27\u201364 (2007). http:\/\/dx.doi.org\/10.1016\/j.cosrev.2007.05.001","journal-title":"Comput. Sci. Rev."},{"key":"9_CR131","doi-asserted-by":"crossref","unstructured":"Schuetz, P., Caflisch, A.: Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement. Phys. Rev. E 77(046112) (2008). http:\/\/scitation.aip.org\/getabs\/servlet\/GetabsServlet?prog=normal&id=PLEEE8000077000004046112000001&idtype=cvips&gifs=yes","DOI":"10.1103\/PhysRevE.77.046112"},{"issue":"8","key":"9_CR132","doi-asserted-by":"crossref","first-page":"1706","DOI":"10.1016\/j.physa.2008.12.021","volume":"388","author":"H Shen","year":"2009","unstructured":"Shen, H., Cheng, X., Cai, K., Hu, M.B.: Detect overlapping and hierarchical community structure in networks. Phys. A: Stat. Mech. Appl. 388(8), 1706\u20131712 (2009). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0378437108010376","journal-title":"Phys. A: Stat. Mech. Appl."},{"issue":"8","key":"9_CR133","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888\u2013905 (2000). http:\/\/doi.ieeecs.org\/10.1109\/34.868688","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"9_CR134","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1093\/comjnl\/16.1.30","volume":"16","author":"R Sibson","year":"1973","unstructured":"Sibson, R.: Slink: an optimally efficient algorithm for the single-link cluster method. Comput. J. 16(1), 30\u201334 (1973). http:\/\/dx.doi.org\/10.1093\/comjnl\/16.1.30","journal-title":"Comput. J."},{"key":"9_CR135","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/11611257_51","volume-title":"SOFSEM 2006: Theory and Practice of Computer Science","author":"J \u0160\u00edma","year":"2006","unstructured":"\u0160\u00edma, J., Schaeffer, S.E.: On the NP-completeness of some graph cluster measures. In: Wiedermann, J., Tel, G., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2006. LNCS, vol. 3831, pp. 530\u2013537. Springer, Heidelberg (2006). doi: 10.1007\/11611257_51 . http:\/\/dx.doi.org\/10.1007\/11611257_51"},{"key":"9_CR136","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s003579900004","volume":"14","author":"TA Snijders","year":"1997","unstructured":"Snijders, T.A., Nowicki, K.: Estimation and prediction of stochastic blockmodels for graphs with latent block structure. J. Classif. 14, 75\u2013100 (1997)","journal-title":"J. Classif."},{"key":"9_CR137","unstructured":"Spiliopoulou, M., Ntoutsi, I., Theodoridis, Y., Schult, R.: MONIC: modeling and monitoring cluster transitions. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 706\u2013711. ACM Press (2006). http:\/\/doi.acm.org\/10.1145\/1150402.1150491"},{"key":"9_CR138","doi-asserted-by":"crossref","unstructured":"Stanton, I., Kliot, G.: Streaming graph partitioning for large distributed graphs. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1222\u20131230. ACM Press (2012)","DOI":"10.1145\/2339530.2339722"},{"key":"9_CR139","doi-asserted-by":"crossref","unstructured":"Staudt, C., Meyerhenke, H.: Engineering high-performance community detection heuristics for massive graphs. In: Proceedings of the 2013 International Conference on Parallel Processing. Conference Publishing Services (CPS) (2013)","DOI":"10.1109\/ICPP.2013.27"},{"key":"9_CR140","unstructured":"Sun, J., Yu, P.S., Papadimitriou, S., Faloutsos, C.: Graphscope: parameter-free mining of large time-evolving graphs. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 687\u2013696. ACM Press (2007). http:\/\/portal.acm.org\/citation.cfm?id=1281192.1281266&coll=Portal&dl=GUIDE&CFID=54298929&CFTOKEN=41087406"},{"key":"9_CR141","doi-asserted-by":"crossref","unstructured":"Sun, Y., Tang, J., Han, J., Gupta, M., Zhao, B.: Community evolution detection in dynamic heterogeneous information networks. In: Proceedings of the Eighth Workshop on Mining and Learning with Graphs, pp. 137\u2013146. ACM Press (2010). http:\/\/doi.acm.org\/10.1145\/1830252.1830270","DOI":"10.1145\/1830252.1830270"},{"issue":"1","key":"9_CR142","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/s00442-006-0553-6","volume":"151","author":"SR Sundaresan","year":"2007","unstructured":"Sundaresan, S.R., Fischhoff, I.R., Dushoff, J.: Network metrics reveal differences in social organization between two fission-fusion species, Grevy\u2019s zebra and onager. Oecologia 151(1), 140\u2013149 (2007)","journal-title":"Oecologia"},{"key":"9_CR143","doi-asserted-by":"crossref","unstructured":"Takaffoli, M., Fagnan, J., Sangi, F., Za\u00efane, O.R.: Tracking changes in dynamic information networks. In: Proceedings of the 2011 IEEE International Conference on Computational Aspects of Social Networks, pp. 94\u2013101. IEEE Computer Society (2011)","DOI":"10.1109\/CASON.2011.6085925"},{"key":"9_CR144","doi-asserted-by":"crossref","unstructured":"Takaffoli, M., Rabbany, R., Za\u00efane, O.R.: Incremental local community identification in dynamic social networks. In: Proceedings of the 2013 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, IEEE Computer Society (2013, to appear)","DOI":"10.1145\/2492517.2492633"},{"key":"9_CR145","unstructured":"Tong, H., Papadimitriou, S., Sun, J., Yu, P.S., Faloutsos, C.: Colibri: fast mining of large static and dynamic graphs. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 686\u2013694. ACM Press (2008). http:\/\/doi.acm.org\/10.1145\/1401890.1401973"},{"key":"9_CR146","doi-asserted-by":"crossref","first-page":"056104","DOI":"10.1103\/PhysRevE.67.056104","volume":"67","author":"A V\u00e1zquez","year":"2003","unstructured":"V\u00e1zquez, A.: Growing network with local rules: preferential attachment, clustering hierarchy, and degree correlations. Phys. Rev. E 67, 056104 (2003). http:\/\/link.aps.org\/doi\/10.1103\/PhysRevE.67.056104","journal-title":"Phys. Rev. E"},{"key":"9_CR147","doi-asserted-by":"crossref","unstructured":"Viswanath, B., Mislove, A., Cha, M., Gummadi, P.K.: On the evolution of user interaction in facebook. In: Proceedings of the 2nd ACM Workshop on Online Social Networks, pp. 37\u201342. ACM Press (2009). http:\/\/doi.acm.org\/10.1145\/1592665.1592675","DOI":"10.1145\/1592665.1592675"},{"key":"9_CR148","unstructured":"Wagner, S., Wagner, D.: Comparing clusterings - an overview. Technical report 2006-04, ITI Wagner, Faculty of Informatics, Universit\u00e4t Karlsruhe (TH) (2007). http:\/\/digbib.ubka.uni-karlsruhe.de\/volltexte\/1000011477"},{"key":"9_CR149","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1080\/01621459.1987.10478385","volume":"82","author":"YJ Wang","year":"1987","unstructured":"Wang, Y.J., Wong, G.Y.: Stochastic blockmodels for directed graphs. J. Am. Stat. Assoc. 82, 8\u201319 (1987)","journal-title":"J. Am. Stat. Assoc."},{"key":"9_CR150","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1086\/210318","volume":"105","author":"DJ Watts","year":"1999","unstructured":"Watts, D.J.: Networks, dynamics, and the small-world phenomenon. Am. J. Sociol. 105, 493\u2013527 (1999)","journal-title":"Am. J. Sociol."},{"issue":"6684","key":"9_CR151","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"key":"9_CR152","unstructured":"Xie, J., Chen, M., Szymanski, B.K.: LabelRankT: incremental community detection in dynamic networks via label propagation. CoRR abs\/1305.2006 (2013). http:\/\/arxiv.org\/abs\/1305.2006"},{"key":"9_CR153","unstructured":"Xie, J., Szymanski, B.K.: LabelRank: a stabilized label propagation algorithm for community detection in networks. CoRR abs\/1303.0868 (2013). http:\/\/arxiv.org\/abs\/1303.0868"},{"key":"9_CR154","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-19656-0_32","volume-title":"Social Computing, Behavioral-Cultural Modeling and Prediction","author":"KS Xu","year":"2011","unstructured":"Xu, K.S., Kliger, M., Hero, A.O.: Tracking communities in dynamic social networks. In: Salerno, J., Yang, S.J., Nau, D., Chai, S.-K. (eds.) SBP 2011. LNCS, vol. 6589, pp. 219\u2013226. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-19656-0_32"},{"key":"9_CR155","doi-asserted-by":"crossref","unstructured":"Xu, X., Yuruk, N., Feng, Z., Schweiger, T.A.J.: Scan: a structural clustering algorithm for networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 824\u2013833. ACM Press (2007)","DOI":"10.1145\/1281192.1281280"},{"issue":"2","key":"9_CR156","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s10994-010-5214-7","volume":"82","author":"T Yang","year":"2011","unstructured":"Yang, T., Chi, Y., Zhu, S., Jin, R.: Detecting communities and their evolutions in dynamic social networks - a Bayesian approach. Mach. Learn. 82(2), 157\u2013189 (2011)","journal-title":"Mach. Learn."},{"key":"9_CR157","unstructured":"Yu, K., Yu, S., Tresp, V.: Soft clustering on graphs. In: Advances in Neural Information Processing Systems 18, p. 5. MIT Press (2006)"},{"key":"9_CR158","doi-asserted-by":"crossref","unstructured":"Yu, S.X., Shi, J.: Multiclass spectral clustering. In: Proceedings of the 9th IEEE International Conference on Computer Vision, pp. 313\u2013319 (2003)","DOI":"10.1109\/ICCV.2003.1238361"},{"key":"9_CR159","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"WW Zachary","year":"1977","unstructured":"Zachary, W.W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33, 452\u2013473 (1977)","journal-title":"J. Anthropol. Res."},{"key":"9_CR160","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Yu, P.S.: On graph stream clustering with side information. In: Proceedings of the Seventh SIAM International Conference on Data Mining, pp. 139\u2013150. SIAM (2013)","DOI":"10.1137\/1.9781611972832.16"},{"key":"9_CR161","doi-asserted-by":"crossref","unstructured":"Zheleva, E., Sharara, H., Getoor, L.: Co-evolution of social and affiliation networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1007\u20131016. ACM Press (2009). http:\/\/doi.acm.org\/10.1145\/1557019.1557128","DOI":"10.1145\/1557019.1557128"},{"key":"9_CR162","doi-asserted-by":"crossref","first-page":"041908","DOI":"10.1103\/PhysRevE.67.041908","volume":"67","author":"H Zhou","year":"2003","unstructured":"Zhou, H.: Network landscape from a Brownian particle\u2019s perspective. Phys. Rev. E 67, 041908 (2003). http:\/\/link.aps.org\/doi\/10.1103\/PhysRevE.67.041908","journal-title":"Phys. Rev. E"}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49487-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T10:05:14Z","timestamp":1749722714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49487-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319494869","9783319494876"],"references-count":162,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49487-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}