{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T12:41:56Z","timestamp":1766580116687},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540770039"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77004-6_5","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T06:40:36Z","timestamp":1195022436000},"page":"56-67","source":"Crossref","is-referenced-by-count":63,"title":["Clustering Social Networks"],"prefix":"10.1007","author":[{"given":"Nina","family":"Mishra","sequence":"first","affiliation":[]},{"given":"Robert","family":"Schreiber","sequence":"additional","affiliation":[]},{"given":"Isabelle","family":"Stanton","sequence":"additional","affiliation":[]},{"given":"Robert E.","family":"Tarjan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/3-540-45995-2_51","volume-title":"LATIN 2002: Theoretical Informatics","author":"J. Abello","year":"2002","unstructured":"Abello, J., Resende, M.G.C., Sudarsky, S.: Massive quasi-clique detection. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol.\u00a02286, pp. 598\u2013612. Springer, Heidelberg (2002)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Aiello, W., Chung, F., Lu, L.: A random graph model for massive graphs. In: STOC 2000. Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, Portland, Oregon, pp. 171\u2013180 (May 21-23, 2000)","DOI":"10.1145\/335305.335326"},{"key":"5_CR3","unstructured":"Van Dongen, S.: A new cluster algorithm for graphs. Technical report, Universiteit Utrecht (July 10, 1998)"},{"issue":"4","key":"5_CR4","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(4), 385\u2013408 (2004)","journal-title":"Internet Mathematics"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"R.E. Gomory","year":"1961","unstructured":"Gomory, R.E., Hu, T.C.: Multi terminal network flows. Journal of the Society for Industrial and Applied Mathematics\u00a09, 551\u2013571 (1961)","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"5_CR6","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. IPL: Information Processing Letters\u00a076, 175\u2013181 (2000)","journal-title":"IPL: Information Processing Letters"},{"key":"5_CR7","unstructured":"KDD Cup 2003 HEP-TH (2003), \n                  \n                    http:\/\/www.cs.cornell.edu\/projects\/kddcup\/datasets.html"},{"issue":"3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On generating all maximal independent sets. Information Processing Letters\u00a027(3), 119\u2013123 (1988)","journal-title":"Information Processing Letters"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Kannan, R., Vempala, S., Vetta, A.: On clusterings \u2014 good, bad and spectral. In: Proceedings of the 41th Annual Symposium on Foundations of Computer Science, pp. 367\u2013377 (2000)","DOI":"10.1109\/SFCS.2000.892125"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/jpdc.1997.1403","volume":"48","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A parallel algorithm for multilevel graph partitioning and sparse matrix ordering. J. Parallel Distrib. Comput.\u00a048(1), 71\u201395 (1998)","journal-title":"J. Parallel Distrib. Comput."},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1145\/1007352.1007438","volume-title":"STOC-2004. Proceedings of the thirty-sixth annual ACM Symposium on Theory of Computing","author":"D. Kempe","year":"2004","unstructured":"Kempe, D., McSherry, F.: A decentralized algorithm for spectral analysis. In: STOC-2004. Proceedings of the thirty-sixth annual ACM Symposium on Theory of Computing, pp. 561\u2013568. ACM Press, New York (June 13-15, 2004)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Krebs, V.: Uncloaking terrorist networks. First Monday\u00a07(4) (2002)","DOI":"10.5210\/fm.v7i4.941"},{"issue":"11-16","key":"5_CR13","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1016\/S1389-1286(99)00040-7","volume":"31","author":"R. Kumar","year":"1999","unstructured":"Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Trawling the Web for emerging cyber-communities. Computer Networks\u00a031(11-16), 1481\u20131493 (1999)","journal-title":"Computer Networks"},{"key":"5_CR14","unstructured":"LiveJournal, \n                  \n                    http:\/\/www.livejournal.com"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"M.E.J. Newman","year":"2006","unstructured":"Newman, M.E.J.: Modularity and community structure in networks. National Academy of Sciences\u00a0103, 8577\u20138582 (2006)","journal-title":"National Academy of Sciences"},{"issue":"8","key":"5_CR16","doi-asserted-by":"publisher","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 Analysis and Machine Intelligence\u00a022(8), 888\u2013905 (2000)","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Spielman, D.A., Teng, S.: Spectral partitioning works: Planar graphs and finite element meshes. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, vol.\u00a037, pp. 96\u2013105 (1996)","DOI":"10.1109\/SFCS.1996.548468"},{"issue":"3","key":"5_CR18","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S. Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM J. Comput.\u00a06(3), 505\u2013517 (1977)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"5_CR19","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1077464.1077466","volume":"1","author":"R. Yuster","year":"2005","unstructured":"Yuster, R., Zwick, U.: Fast sparse matrix multiplication. ACM Transactions on Algorithms\u00a01(1), 2\u201313 (2005)","journal-title":"ACM Transactions on Algorithms"}],"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-77004-6_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:52:40Z","timestamp":1619520760000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77004-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540770039"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77004-6_5","relation":{},"subject":[]}}