{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T10:21:43Z","timestamp":1773224503093,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540748380","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74839-7_12","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T14:55:58Z","timestamp":1196952958000},"page":"121-132","source":"Crossref","is-referenced-by-count":106,"title":["On Finding Graph Clusterings with Maximum Modularity"],"prefix":"10.1007","author":[{"given":"Ulrik","family":"Brandes","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Delling","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Gaertler","sequence":"additional","affiliation":[]},{"given":"Robert","family":"G\u00f6rke","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Hoefer","sequence":"additional","affiliation":[]},{"given":"Zoran","family":"Nikoloski","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"Network Analysis","year":"2005","unstructured":"Brandes, U., Erlebach, T. (eds.): Network Analysis. LNCS, vol.\u00a03418. Springer, Heidelberg (2005)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Physical Review E\u00a069 (2004)","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Fortunato, S., Barthelemy, M.: Resolution Limit in Community Detection. In: Proceedings of the National Academy of Sciences, vol.\u00a0104, pp. 36\u201341 (2007)","DOI":"10.1073\/pnas.0605965104"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Ziv, E., Middendorf, M., Wiggins, C.: Information-Theoretic Approach to Network Modularity. Physical Review E 71 (2005)","DOI":"10.1103\/PhysRevE.71.046117"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Muff, S., Rao, F., Caflisch, A.: Local Modularity Measure for Network Clusterizations. Physical Review E 72 (2005)","DOI":"10.1103\/PhysRevE.72.056107"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/978-3-540-72870-2_2","volume-title":"AAIM 2007","author":"M. Gaertler","year":"2007","unstructured":"Gaertler, M., G\u00f6rke, R., Wagner, D.: Significance-Driven Graph Clustering. In: AAIM 2007. LNCS, pp. 11\u201326. Springer, Heidelberg (2007)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Physical Review E 70 (2004)","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Newman, M.: Modularity and Community Structure in Networks. In: Proceedings of the National Academy of Sciences, pp. 8577\u20138582 (2005)","DOI":"10.1073\/pnas.0601602103"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"White, S., Smyth, P.: A Spectral Clustering Approach to Finding Communities in Graph. In: SIAM Data Mining Conference (2005)","DOI":"10.1137\/1.9781611972757.25"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Reichardt, J., Bornholdt, S.: Statistical Mechanics of Community Detection. Physical Review E 74 (2006)","DOI":"10.1103\/PhysRevE.74.016110"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Duch, J., Arenas, A.: Community Detection in Complex Networks using Extremal Optimization. Physical Review E 72 (2005)","DOI":"10.1103\/PhysRevE.72.027104"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Brandes, U., Delling, D., Gaertler, M., G\u00f6rke, R., H\u00f6fer, M., Nikoloski, Z., Wagner, D.: On Modularity Clustering. IEEE Transactions on Knowledge and Data Engineering (to appear, 2007)","DOI":"10.1109\/TKDE.2007.190689"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Danon, L., D\u00edaz-Guilera, A., Duch, J., Arenas, A.: Comparing community structure identification. Journal of Statistical Mechanics (2005)","DOI":"10.1088\/1742-5468\/2005\/09\/P09008"},{"key":"12_CR14","volume-title":"Computers and Intractability. A Guide to the Theory of $\\mathcal{NP}$ -Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of $\\mathcal{NP}$ -Completeness. W.H.\u00a0Freeman and Company, New York (1979)"},{"key":"12_CR15","unstructured":"Newman, M.: Analysis of Weighted Networks. Technical report, Cornell University, Santa Fe Institute, University of Michigan (2004)"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-9260(95)00008-4","volume":"19","author":"C.J. Alpert","year":"1995","unstructured":"Alpert, C.J., Kahng, A.B.: Recent Directions in Netlist Partitioning: A Survey. Integration: The VLSI Journal\u00a019, 1\u201381 (1995)","journal-title":"Integration: The VLSI Journal"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0020-0190(00)00142-3","volume":"76","author":"E. Hartuv","year":"2000","unstructured":"Hartuv, E., Shamir, R.: A Clustering Algorithm based on Graph Connectivity. Information Processing Letters\u00a076, 175\u2013181 (2000)","journal-title":"Information Processing Letters"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Vempala, S., Kannan, R., Vetta, A.: On Clusterings - Good, Bad and Spectral. In: FOCS 2000. Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pp. 367\u2013378 (2000)","DOI":"10.1109\/SFCS.2000.892125"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Giotis, I., Guruswami, V.: Correlation Clustering with a Fixed Number of Clusters. In: SODA 2006. Proceedings of the 17th Annual ACM\u2013SIAM Symposium on Discrete Algorithms, New York, NY, USA, pp. 1167\u20131176 (2006)","DOI":"10.1145\/1109557.1109686"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF02579448","volume":"7","author":"T.N. Bui","year":"1987","unstructured":"Bui, T.N., Chaudhuri, S., Leighton, F.T., Sipser, M.: Graph bisection algorithms with good average case behavior. Combinatorica\u00a07, 171\u2013191 (1987)","journal-title":"Combinatorica"},{"key":"12_CR21","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"W.W. Zachary","year":"1977","unstructured":"Zachary, W.W.: An Information Flow Model for Conflict and Fission in Small Groups. Journal of Anthropological Research\u00a033, 452\u2013473 (1977)","journal-title":"Journal of Anthropological Research"},{"key":"12_CR22","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)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74839-7_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T08:17:10Z","timestamp":1737620230000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74839-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540748380"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74839-7_12","relation":{},"subject":[]}}