{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:16:56Z","timestamp":1740097016220,"version":"3.37.3"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","funder":[{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS-1342477","IIS-0917381"],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1145\/2660460.2660480","type":"proceedings-article","created":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T13:35:08Z","timestamp":1412170508000},"page":"191-202","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Inferring coarse views of connectivity in very large graphs"],"prefix":"10.1145","author":[{"given":"Reza","family":"Motamedi","sequence":"first","affiliation":[{"name":"University of Oregon, Eugene, Oregon, USA"}]},{"given":"Reza","family":"Rejaie","sequence":"additional","affiliation":[{"name":"University of Oregon, Eugene, Oregon, USA"}]},{"given":"Walter","family":"Willinger","sequence":"additional","affiliation":[{"name":"Niksun, Inc., Princeton, New Jersey, USA"}]},{"given":"Daniel","family":"Lowd","sequence":"additional","affiliation":[{"name":"University of Oregon, Eugene, Oregon, USA"}]},{"given":"Roberto","family":"Gonzalez","sequence":"additional","affiliation":[{"name":"NEC Europe Ltd., Heidelberg, Germany"}]}],"member":"320","published-online":{"date-parts":[[2014,10]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242685"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.44"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1609\/icwsm.v3i1.13937","article-title":"Gephi","volume":"8","author":"Bastian M.","year":"2009","unstructured":"M. Bastian , S. Heymann , M. Jacomy , Gephi : An Open Source Software for Exploring and Manipulating Networks. ICWSM , 8 : 361 -- 362 , 2009 . M. Bastian, S. Heymann, M. Jacomy, et al. Gephi : An Open Source Software for Exploring and Manipulating Networks. ICWSM, 8:361--362,2009.","journal-title":"ICWSM"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_3_2_2_5_1","volume-title":"Spectral Graph Theory. CBMS Regional Conference Series. Conference Board of the Mathematical Sciences","author":"Chung F.","year":"1997","unstructured":"F. Chung . Spectral Graph Theory. CBMS Regional Conference Series. Conference Board of the Mathematical Sciences , 1997 . F. Chung. Spectral Graph Theory. CBMS Regional Conference Series. Conference Board of the Mathematical Sciences, 1997."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014118"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1115"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78808-9_11"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488431"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/990308.990313"},{"key":"e_1_3_2_2_12_1","volume-title":"Version 2.0","author":"Karypis G.","year":"1995","unstructured":"G. Karypis and V. Kumar . METIS - Unstructured Graph Partitioning and Sparse Matrix Ordering System , Version 2.0 , 1995 . G. Karypis and V. Kumar. METIS - Unstructured Graph Partitioning and Sparse Matrix Ordering System, Version 2.0, 1995."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/305219.305248"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1765751.1765753"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_3_2_2_17_1","unstructured":"L. Lov\u00e1sz. Random Walks on Graphs: A Survey. Combinatorics Paul erdos is eighty 2(1):1--46 1993. L. Lov\u00e1sz. Random Walks on Graphs: A Survey. Combinatorics Paul erdos is eighty 2(1):1--46 1993."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"e_1_3_2_2_19_1","volume-title":"WalkAbout: Exploring the Regional Connectivity of Large Graphs and Its Application to OSNs. Technical report available at: http:\/\/onrg.cs.uoregon.edu\/pub\/tr13-06.pdf","author":"Motamedi R.","year":"2014","unstructured":"R. Motamedi , R. Rejaie , D. Lowd , and W. Willinger . WalkAbout: Exploring the Regional Connectivity of Large Graphs and Its Application to OSNs. Technical report available at: http:\/\/onrg.cs.uoregon.edu\/pub\/tr13-06.pdf , University of Oregon , 2014 . R. Motamedi, R. Rejaie, D. Lowd, and W. Willinger. WalkAbout: Exploring the Regional Connectivity of Large Graphs and Its Application to OSNs. Technical report available at: http:\/\/onrg.cs.uoregon.edu\/pub\/tr13-06.pdf, University of Oregon, 2014."},{"key":"e_1_3_2_2_20_1","volume-title":"Interactive Graph Coarsening by WalkAbout. Code available at: http:\/\/onrg.cs.uoregon.edu\/WalkAbout","author":"Nerenberg M.","year":"2014","unstructured":"M. Nerenberg , R. Motamedi , and R. Rejaie . Interactive Graph Coarsening by WalkAbout. Code available at: http:\/\/onrg.cs.uoregon.edu\/WalkAbout , University of Oregon , 2014 . M. Nerenberg, R. Motamedi, and R. Rejaie. Interactive Graph Coarsening by WalkAbout. Code available at: http:\/\/onrg.cs.uoregon.edu\/WalkAbout, University of Oregon, 2014."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0601602103"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00124"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557101"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.900406"},{"key":"e_1_3_2_2_25_1","unstructured":"S. Van Dongen. A cluster algorithm for graphs. Report-Information systems (10):1--40 2000. S. Van Dongen. A cluster algorithm for graphs. Report-Information systems (10):1--40 2000."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972757.25"}],"event":{"name":"COSN'14: Conference on Online Social Networks","sponsor":["ACM Association for Computing Machinery"],"location":"Dublin Ireland","acronym":"COSN'14"},"container-title":["Proceedings of the second ACM conference on Online social networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2660460.2660480","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T21:52:51Z","timestamp":1673128371000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2660460.2660480"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":26,"alternative-id":["10.1145\/2660460.2660480","10.1145\/2660460"],"URL":"https:\/\/doi.org\/10.1145\/2660460.2660480","relation":{},"subject":[],"published":{"date-parts":[[2014,10]]},"assertion":[{"value":"2014-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}