{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:26Z","timestamp":1750306766842,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,10,7]],"date-time":"2013-10-07T00:00:00Z","timestamp":1381104000000},"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":[[2013,10,7]]},"DOI":"10.1145\/2512938.2512953","type":"proceedings-article","created":{"date-parts":[[2013,10,8]],"date-time":"2013-10-08T13:27:04Z","timestamp":1381238824000},"page":"107-118","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Hierarchical community decomposition via oblivious routing techniques"],"prefix":"10.1145","author":[{"given":"William Sean","family":"Kennedy","sequence":"first","affiliation":[{"name":"Bell Labs Research, Murray Hill, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jamie","family":"Morgenstern","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gordon","family":"Wilfong","sequence":"additional","affiliation":[{"name":"Bell Labs Research, Murray Hill, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lisa","family":"Zhang","sequence":"additional","affiliation":[{"name":"Bell Labs Research, Murray Hill, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,10,7]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Data archive at http:\/\/http:\/\/snap.stanford.edu\/.  Data archive at http:\/\/http:\/\/snap.stanford.edu\/."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.44"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1135814"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229020"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007355"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39140-8_11"},{"key":"e_1_3_2_1_7_1","volume-title":"Finding endogenously formed communities. arXiv preprint arXiv:1201.4899","author":"Balcan M.F.","year":"2012","unstructured":"M.F. Balcan , C. Borgs , M. Braverman , J. Chayes , and S.H. Teng . Finding endogenously formed communities. arXiv preprint arXiv:1201.4899 , 2012 . M.F. Balcan, C. Borgs, M. Braverman, J. Chayes, and S.H. Teng. Finding endogenously formed communities. arXiv preprint arXiv:1201.4899, 2012."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777418"},{"key":"e_1_3_2_1_9_1","first-page":"10","article-title":"Fast unfolding of communities in large networks","author":"Blondel V.D","year":"2008","unstructured":"V.D Blondel , J.-L. Guillaume , R. Lambiotte , and E. Lefebvre . Fast unfolding of communities in large networks . Journal of Statistical Mechanics: Theory and Experiment , 10 , 2008 . V.D Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, 10, 2008.","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","DOI":"10.1007\/b106453","volume-title":"Network analysis: methodological foundations","author":"Brandes Ulrik","year":"2005","unstructured":"Ulrik Brandes and Thomas Erlebach . Network analysis: methodological foundations , volume 3418 . Springer , 2005 . Ulrik Brandes and Thomas Erlebach. Network analysis: methodological foundations, volume 3418. Springer, 2005."},{"key":"e_1_3_2_1_11_1","first-page":"199","article-title":"A lower bound for the smallest eigenvalue of the Laplacian. Probl. Analysis, Sympos. in Honor of Salomon Bochner","volume":"195","author":"Cheeger J.","year":"1969","unstructured":"J. Cheeger . A lower bound for the smallest eigenvalue of the Laplacian. Probl. Analysis, Sympos. in Honor of Salomon Bochner , Princeton Univ . 1969 , 195 -- 199 , 1970. J. Cheeger. A lower bound for the smallest eigenvalue of the Laplacian. Probl. Analysis, Sympos. in Honor of Salomon Bochner, Princeton Univ. 1969, 195--199, 1970.","journal-title":"Princeton Univ"},{"key":"e_1_3_2_1_12_1","volume-title":"CBMS Regional Conference Series in Math, No. 92","author":"Chung Fan RK","year":"1997","unstructured":"Fan RK Chung . Spectral graph theory . CBMS Regional Conference Series in Math, No. 92 , 1997 . Fan RK Chung. Spectral graph theory. CBMS Regional Conference Series in Math, No. 92, 1997."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature06830"},{"key":"e_1_3_2_1_14_1","volume-title":"Mark EJ Newman, and Cristopher Moore. Finding community structure in very large networks. Physical review E, 70(6):066111","author":"Clauset Aaron","year":"2004","unstructured":"Aaron Clauset , Mark EJ Newman, and Cristopher Moore. Finding community structure in very large networks. Physical review E, 70(6):066111 , 2004 . Aaron Clauset, Mark EJ Newman, and Cristopher Moore. Finding community structure in very large networks. Physical review E, 70(6):066111, 2004."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1002\/1098-2418(200103)18:2%3C116::AID-RSA1001%3E3.0.CO;2-2"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0609023104"},{"key":"e_1_3_2_1_17_1","unstructured":"Facebook. https:\/\/www.facebook.com\/about\/graphsearch.  Facebook. https:\/\/www.facebook.com\/about\/graphsearch."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347121"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129093"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0605965104"},{"key":"e_1_3_2_1_22_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey Michael R.","year":"1979","unstructured":"Michael R. Garey and David S. Johnson . Computers and Intractability: A Guide to the Theory of NP-Completeness . W. H. Freeman & Co. , New York, NY, USA , 1979 . Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA, 1979."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"e_1_3_2_1_24_1","volume-title":"Community structure in jazz. Advances in complex systems, 6(04):565--573","author":"Gleiser Pablo M","year":"2003","unstructured":"Pablo M Gleiser and Leon Danon . Community structure in jazz. Advances in complex systems, 6(04):565--573 , 2003 . Pablo M Gleiser and Leon Danon. Community structure in jazz. Advances in complex systems, 6(04):565--573, 2003."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777419"},{"key":"e_1_3_2_1_26_1","volume-title":"Approximation algorithms for NP-hard problems","author":"Hochbaum Dorit S","year":"1996","unstructured":"Dorit S Hochbaum . Approximation algorithms for NP-hard problems . PWS Publishing Co. , 1996 . Dorit S Hochbaum. Approximation algorithms for NP-hard problems. PWS Publishing Co., 1996."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871469"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/990308.990313"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289026"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"key":"e_1_3_2_1_31_1","volume-title":"Community detection algorithms: A comparative analysis. Physical review E, 80(5):056117","author":"Lancichinetti Andrea","year":"2009","unstructured":"Andrea Lancichinetti and Santo Fortunato . Community detection algorithms: A comparative analysis. Physical review E, 80(5):056117 , 2009 . Andrea Lancichinetti and Santo Fortunato. Community detection algorithms: A comparative analysis. Physical review E, 80(5):056117, 2009."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331526"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772755"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00265-003-0651-y"},{"key":"e_1_3_2_1_36_1","first-page":"548","volume-title":"Advances in Neural Information Processing Systems 25","author":"McAuley Julian","year":"2012","unstructured":"Julian McAuley and Jure Leskovec . Learning to discover social circles in ego networks . In Advances in Neural Information Processing Systems 25 , pages 548 -- 556 , 2012 . Julian McAuley and Jure Leskovec. Learning to discover social circles in ego networks. In Advances in Neural Information Processing Systems 25, pages 548--556, 2012."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.4064\/fm-10-1-96-115"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/1777879.1777884"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652152"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652152"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1073374"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2007.05.001"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.0081-1750.2003.00134.x"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/11611257_51"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007372"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382616.2382620"}],"event":{"name":"COSN'13: Conference on Online Social Networks","sponsor":["ACM Association for Computing Machinery"],"location":"Boston Massachusetts USA","acronym":"COSN'13"},"container-title":["Proceedings of the first ACM conference on Online social networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2512938.2512953","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2512938.2512953","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:51Z","timestamp":1750231731000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2512938.2512953"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,7]]},"references-count":46,"alternative-id":["10.1145\/2512938.2512953","10.1145\/2512938"],"URL":"https:\/\/doi.org\/10.1145\/2512938.2512953","relation":{},"subject":[],"published":{"date-parts":[[2013,10,7]]},"assertion":[{"value":"2013-10-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}