{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T02:29:41Z","timestamp":1781836181115,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,8,25]],"date-time":"2015-08-25T00:00:00Z","timestamp":1440460800000},"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":[[2015,8,25]]},"DOI":"10.1145\/2808797.2808903","type":"proceedings-article","created":{"date-parts":[[2015,11,13]],"date-time":"2015-11-13T14:56:02Z","timestamp":1447426562000},"page":"65-72","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Near Linear-Time Community Detection in Networks with Hardly Detectable Community Structure"],"prefix":"10.1145","author":[{"given":"Aria","family":"Rezaei","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, Sharif University of Technology"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saeed Mahlouji","family":"Far","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Sharif University of Technology"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mahdieh","family":"Soleymani","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Sharif University of Technology"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,8,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2032324100"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICBAKE.2009.20"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0601602103"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.72.027104"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.21136\/CMJ.1973.101168"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/0611030"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_1_12_1","first-page":"325","volume-title":"A flow-based method for improving the expansion or conductance of graph cuts,\" in Integer Programming and Combinatorial Optimization","author":"Lang K.","year":"2004"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.016110"},{"key":"e_1_3_2_1_14_1","volume-title":"Clustering by passing messages between data points,\" science","author":"Frey B. J."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.93.218701"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-010-0186-6"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0605965104"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.79.066107"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0706851105"},{"key":"e_1_3_2_1_21_1","volume-title":"Jun.","author":"Leskovec J.","year":"2014"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.036103"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.026129"},{"key":"e_1_3_2_1_26_1","volume-title":"Vecchi et al., \"Optimization by simmulated annealing,\" science","author":"Kirkpatrick S."},{"key":"e_1_3_2_1_27_1","first-page":"1695","article-title":"The igraph software package for complex network research","author":"Csardi G.","year":"2006","journal-title":"InterJournal"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.046110"}],"event":{"name":"ASONAM '15: Advances in Social Networks Analysis and Mining 2015","location":"Paris France","acronym":"ASONAM '15","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","IEEE CS"]},"container-title":["Proceedings of the 2015 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining 2015"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2808797.2808903","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2808797.2808903","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:15Z","timestamp":1750225695000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2808797.2808903"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,25]]},"references-count":28,"alternative-id":["10.1145\/2808797.2808903","10.1145\/2808797"],"URL":"https:\/\/doi.org\/10.1145\/2808797.2808903","relation":{},"subject":[],"published":{"date-parts":[[2015,8,25]]},"assertion":[{"value":"2015-08-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}