{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T09:27:29Z","timestamp":1774258049041,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,4,16]],"date-time":"2012-04-16T00:00:00Z","timestamp":1334534400000},"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,4,16]]},"DOI":"10.1145\/2187836.2187884","type":"proceedings-article","created":{"date-parts":[[2012,4,24]],"date-time":"2012-04-24T18:41:27Z","timestamp":1335292887000},"page":"351-360","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":67,"title":["QUBE"],"prefix":"10.1145","author":[{"given":"Min-Joong","family":"Lee","sequence":"first","affiliation":[{"name":"KAIST, Daejeon, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jungmin","family":"Lee","sequence":"additional","affiliation":[{"name":"KAIST, Daejeon, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaimie Yejean","family":"Park","sequence":"additional","affiliation":[{"name":"KAIST, Daejeon, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryan Hyun","family":"Choi","sequence":"additional","affiliation":[{"name":"KAIST, Daejeon, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chin-Wan","family":"Chung","sequence":"additional","affiliation":[{"name":"KAIST, Daejeon, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,4,16]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"besliskunde. The rush in a directed graph. Technical report","author":"Anthonisse J.","year":"1971","unstructured":"J. Anthonisse and S. M. C. A. A. M. besliskunde. The rush in a directed graph. Technical report , 1971 . J. Anthonisse and S. M. C. A. A. M. besliskunde. The rush in a directed graph. Technical report, 1971."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1777879.1777889"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2006.57"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.056122"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2007.11.001"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218127407018403"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti167"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(91)90017-N"},{"key":"e_1_3_2_1_12_1","first-page":"90","volume-title":"Better approximation of betweenness centrality","author":"Geisberger R.","year":"2008","unstructured":"R. Geisberger , P. Sanders , and D. Schultes . Better approximation of betweenness centrality . In J. I. Munro and D. Wagner, editors, ALENEX, pages 90 -- 100 . SIAM , 2008 . R. Geisberger, P. Sanders, and D. Schultes. Better approximation of betweenness centrality. In J. I. Munro and D. Wagner, editors, ALENEX, pages 90--100. SIAM, 2008."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0219525903000803"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216026"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470400"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27836-8_71"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2009.02.003"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2006.01.051"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20614"},{"key":"e_1_3_2_1_21_1","volume-title":"Simple linear time approximation algorithm for betweenness. Technical report","author":"Makarychev Y.","year":"2009","unstructured":"Y. Makarychev . Simple linear time approximation algorithm for betweenness. Technical report , 2009 . Y. Makarychev. Simple linear time approximation algorithm for betweenness. Technical report, 2009."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2004.11.009"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"e_1_3_2_1_24_1","volume-title":"Visualization and Analysis of the Telecommunications and Media Ownership Network","author":"Norlen K.","year":"2002","unstructured":"K. Norlen , G. Lucas , M. Gebbie , and J. Chuang . EVA: Extraction , Visualization and Analysis of the Telecommunications and Media Ownership Network , Aug. 2002 . K. Norlen, G. Lucas, M. Gebbie, and J. Chuang. EVA: Extraction, Visualization and Analysis of the Telecommunications and Media Ownership Network, Aug. 2002."},{"key":"e_1_3_2_1_25_1","first-page":"87","volume-title":"Interdisciplinary Statistics and Bioinformatics","author":"Pinney J. W.","year":"2006","unstructured":"J. W. Pinney and D. R. Westhead . Betweenness-based decomposition methods for social and biological networks . In Interdisciplinary Statistics and Bioinformatics , pages 87 -- 90 . Leeds University Press , 2006 . J. W. Pinney and D. R. Westhead. Betweenness-based decomposition methods for social and biological networks. In Interdisciplinary Statistics and Bioinformatics, pages 87--90. Leeds University Press, 2006."}],"event":{"name":"WWW 2012: 21st World Wide Web Conference 2012","location":"Lyon France","acronym":"WWW 2012","sponsor":["Univ. de Lyon Universite de Lyon","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the 21st international conference on World Wide Web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2187836.2187884","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2187836.2187884","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:34Z","timestamp":1750241194000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2187836.2187884"}},"subtitle":["a quick algorithm for updating betweenness centrality"],"short-title":[],"issued":{"date-parts":[[2012,4,16]]},"references-count":25,"alternative-id":["10.1145\/2187836.2187884","10.1145\/2187836"],"URL":"https:\/\/doi.org\/10.1145\/2187836.2187884","relation":{},"subject":[],"published":{"date-parts":[[2012,4,16]]},"assertion":[{"value":"2012-04-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}