{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:04:19Z","timestamp":1725516259229},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540788072"},{"type":"electronic","value":"9783540788089"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78808-9_11","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"117-128","source":"Crossref","is-referenced-by-count":21,"title":["A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection"],"prefix":"10.1007","author":[{"given":"Hristo N.","family":"Djidjev","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1038\/43601","volume":"401","author":"R. Albert","year":"1999","unstructured":"Albert, R., Jeong, H., Barab\u00e1si, A.L.: Diameter of the World Wide Web. Nature\u00a0401, 130 (1999)","journal-title":"Nature"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A.L. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of Scaling in Random Networks. Science\u00a0286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/cpe.4330060203","volume":"6","author":"S.T. Barnard","year":"1994","unstructured":"Barnard, S.T., Simon, H.D.: A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice and Experience\u00a06, 101\u2013107 (1994)","journal-title":"Concurrency: Practice and Experience"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/PL00012580","volume":"6","author":"F. Chung","year":"2002","unstructured":"Chung, F., Lu, L.: Connected components in random graphs with given degree sequences. Annals of Combinatorics\u00a06, 125\u2013145 (2002)","journal-title":"Annals of Combinatorics"},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A. Clauset","year":"2004","unstructured":"Clauset, A., Newman, M., Moore, C.: Finding community structure in very large networks. Phys. Rev. E\u00a070, 066111 (2004)","journal-title":"Phys. Rev. E"},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P. Erdos","year":"1959","unstructured":"Erdos, P., Renyi, A.: On random graphs. Publicationes Mathematicae\u00a06, 290\u2013297 (1959)","journal-title":"Publicationes Mathematicae"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M., Mattheyses, R.M.: A linear time heuristic for improving network partitions. IEEE Design Automation Conference, 175\u2013181 (1982)","DOI":"10.1109\/DAC.1982.1585498"},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1080\/15427951.2004.10129093","volume":"1","author":"G.W. Flake","year":"2004","unstructured":"Flake, G.W., Tarjan, R.E., Tsioutsiouliklis, K.: Graph Clustering and Minimum Cut Trees. Internet Mathematics\u00a01, 385\u2013408 (2004)","journal-title":"Internet Mathematics"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Hendrickson, B., Leland, R.: A Multilevel Algorithm for Partitioning Graphs. In: ACM\/IEEE conference on Supercomputing (1995)","DOI":"10.1145\/224170.224228"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M. Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA\u00a099, 7821\u20137826 (2002)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: Multilevel graph partitioning schemes. In: International Conference on Parallel Processing, pp. 113\u2013122 (1995)","DOI":"10.1145\/224170.224229"},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1999","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing\u00a020(1), 359\u2013392 (1999)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Kerninghan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal (1970)","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"11_CR15","doi-asserted-by":"crossref","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"M. Newman","year":"2004","unstructured":"Newman, M.: Fast algorithm for detecting community structure in networks, Phys. Phys. Rev. E\u00a069, 066133 (2004)","journal-title":"Phys. Phys. Rev. E"},{"key":"11_CR16","doi-asserted-by":"crossref","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"M. Newman","year":"2006","unstructured":"Newman, M.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E\u00a074, 036104 (2006)","journal-title":"Phys. Rev. E"},{"key":"11_CR17","doi-asserted-by":"crossref","first-page":"026126","DOI":"10.1103\/PhysRevE.67.026126","volume":"67","author":"M. Newman","year":"2003","unstructured":"Newman, M.: Mixing patterns in networks. Phys. Rev. E\u00a067, 026126 (2003)","journal-title":"Phys. Rev. E"},{"key":"11_CR18","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"M. Newman","year":"2004","unstructured":"Newman, M., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E\u00a069, 026113 (2004)","journal-title":"Phys. Rev. E"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"White, S., Smyth, P.: A Spectral Clustering Approach to Finding Communities in Graphs. In: Proceedings of the SIAM International Conference on Data Mining (2005)","DOI":"10.1137\/1.9781611972757.25"},{"key":"11_CR20","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"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web-Graph"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78808-9_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T14:51:09Z","timestamp":1684507869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78808-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540788072","9783540788089"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78808-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}