{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T12:47:50Z","timestamp":1762606070366,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,2,8]],"date-time":"2012-02-08T00:00:00Z","timestamp":1328659200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,2,8]]},"DOI":"10.1145\/2124295.2124330","type":"proceedings-article","created":{"date-parts":[[2012,2,14]],"date-time":"2012-02-14T13:21:44Z","timestamp":1329225704000},"page":"273-282","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Overlapping clusters for distributed computation"],"prefix":"10.1145","author":[{"given":"Reid","family":"Andersen","sequence":"first","affiliation":[{"name":"Microsoft Corporation, Redmond, WA, USA"}]},{"given":"David F.","family":"Gleich","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}]},{"given":"Vahab","family":"Mirrokni","sequence":"additional","affiliation":[{"name":"Google Research, New York, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,2,8]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature09182"},{"key":"e_1_3_2_2_2_1","first-page":"1003","volume-title":"SODA","author":"Andersen R.","year":"2008","unstructured":"R. Andersen . A local algorithm for finding dense subgraphs . In SODA , pages 1003 -- 1009 , 2008 . R. Andersen. A local algorithm for finding dense subgraphs. In SODA, pages 1003--1009, 2008."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.44"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1502793.1502794"},{"key":"e_1_3_2_2_5_1","series-title":"LNCS","first-page":"782","volume-title":"Automata, Languages and Programming","author":"Berman P.","year":"2002","unstructured":"P. Berman and M. Karpinski . Approximation hardness of bounded degree min-csp and min-bisection . In Automata, Languages and Programming , volume 2380 of LNCS , pages 782 -- 782 . Springer Berlin \/ Heidelberg , 2002 . P. Berman and M. Karpinski. Approximation hardness of bounded degree min-csp and min-bisection. In Automata, Languages and Programming, volume 2380 of LNCS, pages 782--782. Springer Berlin \/ Heidelberg, 2002."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/040616541"},{"key":"e_1_3_2_2_7_1","volume-title":"Granada","author":"Bru R.","year":"2005","unstructured":"R. Bru , F. Pedroche , and D. B. Szyld . C\u00e1lculo del vector PageRank de Google mediante el m\u00e9todo iterativo de Schwarz. In J. P. A. et al., editor, Congreso de M\u00e9todos Num\u00e9ricos en Ingenier\u00eda , Granada , Spain , 2005 . In Spanish. R. Bru, F. Pedroche, and D. B. Szyld. C\u00e1lculo del vector PageRank de Google mediante el m\u00e9todo iterativo de Schwarz. In J. P. A. et al., editor, Congreso de M\u00e9todos Num\u00e9ricos en Ingenier\u00eda, Granada, Spain, 2005. In Spanish."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90140-Q"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.780863"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/13.2.156"},{"key":"e_1_3_2_2_11_1","volume-title":"Finding cycles and trees in sublinear time. arXiv, cs.DM:1007.4230","author":"Czumaj A.","year":"2010","unstructured":"A. Czumaj , O. Goldreich , D. Ron , C. Seshadhri , A. Shapira , and C. Sohler . Finding cycles and trees in sublinear time. arXiv, cs.DM:1007.4230 , 2010 . A. Czumaj, O. Goldreich, D. Ron, C. Seshadhri, A. Shapira, and C. Sohler. Finding cycles and trees in sublinear time. arXiv, cs.DM:1007.4230, 2010."},{"key":"e_1_3_2_2_12_1","volume-title":"The University of Florida Sparse Matrix Collection. Submitted","author":"Davis T. A.","year":"2010","unstructured":"T. A. Davis and Y. Hu . The University of Florida Sparse Matrix Collection. Submitted ., 2010 . T. A. Davis and Y. Hu. The University of Florida Sparse Matrix Collection. Submitted., 2010."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1115"},{"key":"e_1_3_2_2_14_1","volume-title":"The Sourcebook of Parallel Computing","author":"Dongarra J.","year":"2003","unstructured":"J. Dongarra , I. Foster , G. Fox , W. Gropp , K. Kennedy , L. Torczon , and A. White . The Sourcebook of Parallel Computing . Morgan Kaufmann Publishers Inc ., San Francisco, CA, USA, 2003 . J. Dongarra, I. Foster, G. Fox, W. Gropp, K. Kennedy, L. Torczon, and A. White. The Sourcebook of Parallel Computing. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2003."},{"key":"e_1_3_2_2_15_1","volume-title":"Community detection in graphs. arXiv, physics.soc-ph:0906.0612v2","author":"Fortunato S.","year":"2010","unstructured":"S. Fortunato . Community detection in graphs. arXiv, physics.soc-ph:0906.0612v2 , 2010 . S. Fortunato. Community detection in graphs. arXiv, physics.soc-ph:0906.0612v2, 2010."},{"key":"e_1_3_2_2_17_1","volume-title":"Getting up to Speed: The Future of Supercomputing","author":"Graham S. L.","year":"2005","unstructured":"S. L. Graham , M. Snir , and C. A. Patterson , editors . Getting up to Speed: The Future of Supercomputing . National Academies Press , 2005 . S. L. Graham, M. Snir, and C. A. Patterson, editors. Getting up to Speed: The Future of Supercomputing. National Academies Press, 2005."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(00)00048-X"},{"key":"e_1_3_2_2_19_1","first-page":"367","volume-title":"Innovations in Computer Science","author":"Kale S.","year":"2011","unstructured":"S. Kale and C. Seshadhri . Combinatorial approximation algorithms for maxcut using random walks . In Innovations in Computer Science , pages 367 -- 388 , 2011 . S. Kale and C. Seshadhri. Combinatorial approximation algorithms for maxcut using random walks. In Innovations in Computer Science, pages 367--388, 2011."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873677"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289026"},{"key":"e_1_3_2_2_23_1","volume-title":"LATIN","author":"Khandekar R.","year":"2012","unstructured":"R. Khandekar , G. Kortsarz , and V. Mirrokni . On the advantage of overlapping clusters for minimizing conductance . In LATIN , 2012 . R. Khandekar, G. Kortsarz, and V. Mirrokni. On the advantage of overlapping clusters for minimizing conductance. In LATIN, 2012."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.59"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331526"},{"key":"e_1_3_2_2_26_1","volume-title":"http:\/\/snap.stanford.edu\/data\/index.html","author":"Leskovec J.","year":"2010","unstructured":"J. Leskovec . The Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data\/index.html , 2010 . J. Leskovec. The Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data\/index.html, 2010."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367591"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542506060017"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060829"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1777879.1777884"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654096"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-007-0057-y"},{"key":"e_1_3_2_2_34_1","volume-title":"Near-optimal sublinear time bounds for distributed random walks. arXiv, cs.DS:0911.3195","author":"Sarma A. D.","year":"2009","unstructured":"A. D. Sarma , D. Nanongkai , G. Pandurangan , and P. Tetali . Near-optimal sublinear time bounds for distributed random walks. arXiv, cs.DS:0911.3195 , 2009 . A. D. Sarma, D. Nanongkai, G. Pandurangan, and P. Tetali. Near-optimal sublinear time bounds for distributed random walks. arXiv, cs.DS:0911.3195, 2009."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875505"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553498"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002110050449"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2001.925093"},{"volume-title":"The Library of Congress subject headings. http:\/\/id.loc.gov, 2009","year":"2009","key":"e_1_3_2_2_39_1","unstructured":"Various. The Library of Congress subject headings. http:\/\/id.loc.gov, 2009 . Accessed in September 2009 . Various. The Library of Congress subject headings. http:\/\/id.loc.gov, 2009. Accessed in September 2009."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102482"}],"event":{"name":"WSDM'12: Fifth ACM International Conference on Web Search and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Seattle Washington USA","acronym":"WSDM'12"},"container-title":["Proceedings of the fifth ACM international conference on Web search and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2124295.2124330","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2124295.2124330","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:07:33Z","timestamp":1750273653000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2124295.2124330"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,8]]},"references-count":38,"alternative-id":["10.1145\/2124295.2124330","10.1145\/2124295"],"URL":"https:\/\/doi.org\/10.1145\/2124295.2124330","relation":{},"subject":[],"published":{"date-parts":[[2012,2,8]]},"assertion":[{"value":"2012-02-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}