{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:26:09Z","timestamp":1750307169846,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,11,12]],"date-time":"2011-11-12T00:00:00Z","timestamp":1321056000000},"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":[[2011,11,12]]},"DOI":"10.1145\/2148600.2148663","type":"proceedings-article","created":{"date-parts":[[2012,2,28]],"date-time":"2012-02-28T12:58:45Z","timestamp":1330433925000},"page":"121-122","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["ACM SRC poster"],"prefix":"10.1145","author":[{"given":"Sanjukta","family":"Bhowmick","sequence":"first","affiliation":[{"name":"University of Nebraska at Omaha, Omaha, NE, USA"}]},{"given":"Vyacheslav V.","family":"Rykov","sequence":"additional","affiliation":[{"name":"University of Nebraska at Omaha, Omaha, NE, USA"}]},{"given":"Vladimir V.","family":"Ufimtsev","sequence":"additional","affiliation":[{"name":"University of Nebraska at Omaha, Omaha, NE, USA"}]}],"member":"320","published-online":{"date-parts":[[2011,11,12]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"4863","article-title":"Approximating Betweenness Centrality","author":"Bader D.","year":"2007","unstructured":"D. Bader , S. Kintali , K. Madduri , M. Mihail , \" Approximating Betweenness Centrality \", WAW 2007 , 4863 , 134 (2007). D. Bader, S. Kintali, K. Madduri, M. Mihail, \"Approximating Betweenness Centrality\", WAW2007, 4863, 134 (2007).","journal-title":"WAW"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2006.57"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1142\/1936"},{"key":"e_1_3_2_2_5_1","unstructured":"DIMACS 10th Implementation Challenge http:\/\/www.cc.gatech.edu\/dimacs10\/archive\/clustering.shtml (2011).  DIMACS 10th Implementation Challenge http:\/\/www.cc.gatech.edu\/dimacs10\/archive\/clustering.shtml (2011)."},{"key":"e_1_3_2_2_6_1","first-page":"n3","article-title":"Bounds on the Length of Disjunctive Codes","volume":"18","author":"D'yachkov A. G.","year":"1982","unstructured":"A. G. D'yachkov and V. V. Rykov , \" Bounds on the Length of Disjunctive Codes \", Prob. Pered. Inform. , 18 , n3 , 7 ( 1982 ). A. G. D'yachkov and V. V. Rykov, \"Bounds on the Length of Disjunctive Codes\", Prob. Pered. Inform., 18, n3, 7 (1982).","journal-title":"Prob. Pered. Inform."},{"key":"e_1_3_2_2_7_1","first-page":"n4","article-title":"Superimposed Distance Codes","volume":"18","author":"D'yachkov A. G.","year":"1989","unstructured":"A. G. D'yachkov , V. V. Rykov , A. M. Rashad , \" Superimposed Distance Codes \", Prob. Cont. Inform. Theory , 18 , n4 , 237 ( 1989 ). A. G. D'yachkov, V. V. Rykov, A. M. Rashad, \"Superimposed Distance Codes\", Prob. Cont. Inform. Theory, 18, n4, 237 (1989).","journal-title":"Prob. Cont. Inform. Theory"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2010.31"}],"event":{"name":"SC '11: International Conference for High Performance Computing, Networking, Storage and Analysis","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture","IEEE-CS Computer Society"],"location":"Seattle Washington USA","acronym":"SC '11"},"container-title":["Proceedings of the 2011 companion on High Performance Computing Networking, Storage and Analysis Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2148600.2148663","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2148600.2148663","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:54:43Z","timestamp":1750240483000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2148600.2148663"}},"subtitle":["a scalable group testing based algorithm for finding d-highest betweenness centrality vertices in large scale networks"],"short-title":[],"issued":{"date-parts":[[2011,11,12]]},"references-count":10,"alternative-id":["10.1145\/2148600.2148663","10.1145\/2148600"],"URL":"https:\/\/doi.org\/10.1145\/2148600.2148663","relation":{},"subject":[],"published":{"date-parts":[[2011,11,12]]},"assertion":[{"value":"2011-11-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}