{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T15:40:00Z","timestamp":1771602000340,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642131929","type":"print"},{"value":"9783642131936","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13193-6_37","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T11:54:59Z","timestamp":1272369299000},"page":"436-448","source":"Crossref","is-referenced-by-count":30,"title":["Modularity-Driven Clustering of Dynamic Graphs"],"prefix":"10.1007","author":[{"given":"Robert","family":"G\u00f6rke","sequence":"first","affiliation":[]},{"given":"Pascal","family":"Maillard","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Staudt","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"G\u00f6rke, R., Maillard, P., Staudt, C., Wagner, D.: Modularity-Driven Clustering of Dynamic Graphs. Technical report, Universit\u00e4t Karlsruhe (TH), Informatik, TR 2010-5 (2010)","DOI":"10.1007\/978-3-642-13193-6_37"},{"issue":"2","key":"37_CR2","first-page":"172","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 TKDE\u00a020(2), 172\u2013188 (2008)","journal-title":"IEEE TKDE"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Fortunato, S.: Community detection in graphs. Elsevier Phys.\u00a0R\u00a0486(3-5) (2009)","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Physical Review E\u00a069(026113) (2004)","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"37_CR5","first-page":"206","volume-title":"Proc.\u00a0of the 10th ACM SIGKDD Int.\u00a0Conf.","author":"E. Keogh","year":"2004","unstructured":"Keogh, E., Lonardi, S., Ratanamahatana, C.A.: Towards Parameter-Free Data Mining. In: Proc.\u00a0of the 10th ACM SIGKDD Int.\u00a0Conf., pp. 206\u2013215. ACM, New York (2004)"},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1109\/SAHCN.2006.288528","volume-title":"Proc.\u00a0of Sensor and Ad Hoc Communications and Networks","author":"S.E. Schaeffer","year":"2006","unstructured":"Schaeffer, S.E., Marinoni, S., S\u00e4rel\u00e4, M., Nikander, P.: Dynamic Local Clustering for Hierarchical Ad Hoc Networks. In: Proc.\u00a0of Sensor and Ad Hoc Communications and Networks, vol.\u00a02, pp. 667\u2013672. IEEE, Los Alamitos (2006)"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Blondel, V., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. Journal of Statistical Mechanics: The.\u00a0and Exp. 2008(10)","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"37_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-642-02158-9_14","volume-title":"Algorithmic Aspects in Information and Management","author":"D. Delling","year":"2009","unstructured":"Delling, D., G\u00f6rke, R., Schulz, C., Wagner, D.: ORCA Reduction and ContrAction Graph Clustering. In: Goldberg, A.V., Zhou, Y. (eds.) AAIM 2009. LNCS, vol.\u00a05564, pp. 152\u2013165. Springer, Heidelberg (2009)"},{"key":"37_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/978-3-642-03367-4_30","volume-title":"WADS 2009","author":"R. G\u00f6rke","year":"2009","unstructured":"G\u00f6rke, R., Hartmann, T., Wagner, D.: Dynamic Graph Clustering Using Minimum-Cut Trees. In: Dehne, F., et al. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 339\u2013350. Springer, Heidelberg (2009)"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Khan, O., Kulis, B., Selman, B.: Tracking Evolving Communities in Large Linked Networks. Proceedings of the National Academy of Science of the United States of America\u00a0101 (April 2004)","DOI":"10.1073\/pnas.0307750100"},{"key":"37_CR11","doi-asserted-by":"publisher","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\u00a0446, 664\u2013667 (2007)","journal-title":"Nature"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Yu, P.S.: Online Analysis of Community Evolution in Data Streams. In: [31]","DOI":"10.1137\/1.9781611972757.6"},{"key":"37_CR13","first-page":"687","volume-title":"Proc.\u00a0of the 13th ACM SIGKDD Int.\u00a0Conference","author":"J. Sun","year":"2007","unstructured":"Sun, J., Yu, P.S., Papadimitriou, S., Faloutsos, C.: GraphScope: Parameter-Free Mining of Large Time-Evolving Graphs. In: Proc.\u00a0of the 13th ACM SIGKDD Int.\u00a0Conference, pp. 687\u2013696. ACM Press, New York (2007)"},{"key":"37_CR14","unstructured":"H\u00fcbner, F.: The Dynamic Graph Clustering Problem - ILP-Based Approaches Balancing Optimality and the Mental Map. Master\u2019s thesis, Universit\u00e4t Karlsruhe (TH), Fakult\u00e4t f\u00fcr Informatik (May 2008)"},{"key":"37_CR15","first-page":"554","volume-title":"Proc.\u00a0of the 12th ACM SIGKDD Int.\u00a0Conference","author":"D. Chakrabarti","year":"2006","unstructured":"Chakrabarti, D., Kumar, R., Tomkins, A.S.: Evolutionary Clustering. In: Proc.\u00a0of the 12th ACM SIGKDD Int.\u00a0Conference, pp. 554\u2013560. ACM Press, New York (2006)"},{"issue":"1","key":"37_CR16","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"S.E. Schaeffer","year":"2007","unstructured":"Schaeffer, S.E.: Graph Clustering. Computer Science Review\u00a01(1), 27\u201364 (2007)","journal-title":"Computer Science Review"},{"key":"37_CR17","doi-asserted-by":"crossref","unstructured":"White, S., Smyth, P.: A Spectral Clustering Approach to Finding Communities in Graphs. In: [31], pp. 274\u2013285","DOI":"10.1137\/1.9781611972757.25"},{"issue":"2","key":"37_CR18","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. Journal of Graph Algorithms and Applications\u00a010(2), 191\u2013218 (2006)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"37_CR19","unstructured":"van Dongen, S.M.: Graph Clustering by Flow Simulation. PhD thesis, University of Utrecht (2000)"},{"key":"37_CR20","doi-asserted-by":"crossref","unstructured":"Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Physical Review E\u00a070(066111) (2004)","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"37_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"Network Analysis","year":"2005","unstructured":"Brandes, U., Erlebach, T. (eds.): Network Analysis: Methodological Foundations. LNCS, vol.\u00a03418. Springer, Heidelberg (2005)"},{"issue":"1","key":"37_CR22","doi-asserted-by":"publisher","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. PNAS\u00a0104(1), 36\u201341 (2007)","journal-title":"PNAS"},{"issue":"056131","key":"37_CR23","first-page":"1","volume":"70","author":"M.E.J. Newman","year":"2004","unstructured":"Newman, M.E.J.: Analysis of Weighted Networks. P.\u00a0R.\u00a0E\u00a070(056131), 1\u20139 (2004)","journal-title":"P.\u00a0R.\u00a0E"},{"key":"37_CR24","doi-asserted-by":"crossref","unstructured":"G\u00f6rke, R., Gaertler, M., H\u00fcbner, F., Wagner, D.: Computational Aspects of Lucidity-Driven Graph Clustering. JGAA\u00a014(2) (2010)","DOI":"10.7155\/jgaa.00203"},{"key":"37_CR25","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.\u00a05034, pp. 131\u2013142. Springer, Heidelberg (2008)"},{"key":"37_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/978-3-642-02011-7_24","volume-title":"SEA 2009","author":"A. Noack","year":"2009","unstructured":"Noack, A., Rotta, R.: Multi-level Algorithms for Modularity Clustering. In: Vahrenhold, J. (ed.) SEA 2009. LNCS, vol.\u00a05526, pp. 257\u2013268. Springer, Heidelberg (2009)"},{"key":"37_CR27","unstructured":"G\u00f6rke, R., Staudt, C.: A Generator for Dynamic Clustered Random Graphs. Technical report, Universit\u00e4t Karlsruhe (TH), Informatik, TR 2009-7 (2009)"},{"key":"37_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1007\/978-3-540-39658-1_52","volume-title":"Algorithms - ESA 2003","author":"U. Brandes","year":"2003","unstructured":"Brandes, U., Gaertler, M., Wagner, D.: Experiments on Graph Clustering Algorithms. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 568\u2013579. Springer, Heidelberg (2003)"},{"key":"37_CR29","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1038\/nature03288","volume":"433","author":"R. Guimer\u00e0","year":"2005","unstructured":"Guimer\u00e0, R., Amaral, L.A.N.: Functional Cartography of Complex Metabolic Networks. Nature\u00a0433, 895\u2013900 (2005)","journal-title":"Nature"},{"key":"37_CR30","doi-asserted-by":"crossref","unstructured":"Good, B.H., de Montjoye, Y., Clauset, A.: The performance of modularity maximization in practical contexts. arxiv.org\/abs\/0910.0165 (2009)","DOI":"10.1103\/PhysRevE.81.046106"},{"key":"37_CR31","unstructured":"Proceedings of the fifth SIAM International Conference on Data Mining. SIAM, Philadelphia (2005)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13193-6_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T19:50:39Z","timestamp":1635277839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}