{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:47:18Z","timestamp":1742914038454,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642368431"},{"type":"electronic","value":"9783642368448"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36844-8_13","type":"book-chapter","created":{"date-parts":[[2013,2,19]],"date-time":"2013-02-19T00:03:28Z","timestamp":1361232208000},"page":"133-144","source":"Crossref","is-referenced-by-count":2,"title":["Scalable Graph Clustering with Pregel"],"prefix":"10.1007","author":[{"given":"Bryan","family":"Perozzi","sequence":"first","affiliation":[]},{"given":"Christopher","family":"McCubbin","sequence":"additional","affiliation":[]},{"given":"Spencer","family":"Beecher","sequence":"additional","affiliation":[]},{"given":"J. T.","family":"Halbert","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"7307","key":"13_CR1","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1038\/nature09182","volume":"466","author":"Y.Y. Ahn","year":"2010","unstructured":"Ahn, Y.Y., Bagrow, J.P., Lehmann, S.: Link communities reveal multiscale complexity in networks. Nature\u00a0466(7307), 761\u2013764 (2010)","journal-title":"Nature"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F., Lang, K.: Local graph partitioning using pagerank vectors. In: 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006, pp. 475\u2013486. IEEE (2006)","DOI":"10.1109\/FOCS.2006.44"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Andersen, R., Peres, Y.: Finding sparse cuts locally using evolving sets, CoRR, abs\/0811.3779 (2008)","DOI":"10.1145\/1536414.1536449"},{"key":"13_CR4","unstructured":"Apache giraph (February 2012), \n                    http:\/\/incubator.apache.org\/giraph\/"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1145\/1989323.1989425","volume-title":"Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data, SIGMOD 2011","author":"B. Bahmani","year":"2011","unstructured":"Bahmani, B., Chakrabarti, K., Xin, D.: Fast personalized pagerank on mapreduce. In: Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data, SIGMOD 2011, pp. 973\u2013984. ACM, New York (2011)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., Mech, E.L.J.S.: Fast unfolding of communities in large networks. J. Stat. Mech., P10008 (2008)","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J. Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: simplified data processing on large clusters. Commun. ACM\u00a051(1), 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Gleich, D.F., Seshadhri, C.: Vertex neighborhoods, low conductance cuts, and good seeds for local community methods. In: KDD, pp. 597\u2013605 (2012)","DOI":"10.1145\/2339530.2339628"},{"key":"13_CR9","first-page":"17","volume-title":"Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation, OSDI 2012","author":"J.E. Gonzalez","year":"2012","unstructured":"Gonzalez, J.E., Low, Y., Gu, H., Bickson, D., Guestrin, C.: Powergraph: distributed graph-parallel computation on natural graphs. In: Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation, OSDI 2012, pp. 17\u201330. USENIX Association, Berkeley (2012)"},{"issue":"3","key":"13_CR10","doi-asserted-by":"publisher","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 and spectral. J. ACM\u00a051(3), 497\u2013515 (2004)","journal-title":"J. ACM"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1145\/1367497.1367591","volume-title":"roceedings of the 17th International Conference on World Wide Web, WWW 2008","author":"J. Leskovec","year":"2008","unstructured":"Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Statistical properties of community structure in large social and information networks. In: roceedings of the 17th International Conference on World Wide Web, WWW 2008, pp. 695\u2013704. ACM, New York (2008)"},{"issue":"4","key":"13_CR12","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1002\/rsa.3240040402","volume":"4","author":"L. Lov\u00e1sz","year":"1993","unstructured":"Lov\u00e1sz, L., Simonovits, M.: Random walks in a convex body and an improved volume algorithm. Random Structures & Algorithms\u00a04(4), 359\u2013412 (1993)","journal-title":"Random Structures & Algorithms"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/1807167.1807184","volume-title":"Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, SIGMOD 2010","author":"G. Malewicz","year":"2010","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J.C., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, SIGMOD 2010, pp. 135\u2013146. ACM, New York (2010)"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/1807167.1807184","volume-title":"Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, SIGMOD 2010","author":"G. Malewicz","year":"2010","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J.C., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, SIGMOD 2010, pp. 135\u2013146. ACM, New York (2010)"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"McCubbin, C., Perozzi, B., Levine, A., Rahman, A.: Finding the \u2019needle\u2019: Locating interesting nodes using the k-shortest paths algorithm in mapreduce. In: 2011 IEEE International Conference on Data Mining Workshops, pp. 180\u2013187 (2011)","DOI":"10.1109\/ICDMW.2011.84"},{"issue":"23","key":"13_CR16","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. Proceedings of the National Academy of Sciences\u00a0103(23), 8577\u20138582 (2006)","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"1","key":"13_CR17","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":"13_CR18","doi-asserted-by":"crossref","unstructured":"Spielman, D.A., Teng, S.H.: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, pp. 81\u201390. ACM (2004)","DOI":"10.1145\/1007352.1007372"},{"key":"13_CR19","unstructured":"Spielman, D.A., Teng, S.-H.: A local clustering algorithm for massive graphs and its application to nearly-linear time graph partitioning, CoRR, abs\/0809.3232 (2008)"},{"key":"13_CR20","unstructured":"Yang, J., Leskovec, J.: Structure and overlaps of communities in networks, CoRR, abs\/1205.6228 (2012)"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Zhao, Z., Wang, G., Butt, A.R., Khan, M., Kumar, V.S., Marathe, M.V.: Sahad: Subgraph analysis in massive networks using hadoop. In: 2012 IEEE 26th International Parallel & Distributed Processing Symposium (IPDPS), pp. 390\u2013401. IEEE (2012)","DOI":"10.1109\/IPDPS.2012.44"}],"container-title":["Studies in Computational Intelligence","Complex Networks IV"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36844-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,13]],"date-time":"2023-02-13T14:23:25Z","timestamp":1676298205000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-36844-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642368431","9783642368448"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36844-8_13","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2013]]}}}