{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,20]],"date-time":"2026-09-20T05:45:24Z","timestamp":1789883124173,"version":"4.0.1"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,13]],"date-time":"2017-08-13T00:00:00Z","timestamp":1502582400000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1247581"],"award-info":[{"award-number":["IIS-1247581"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","award":["R01-CA180776"],"award-info":[{"award-number":["R01-CA180776"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,8,13]]},"DOI":"10.1145\/2939672.2939770","type":"proceedings-article","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T14:33:46Z","timestamp":1470666826000},"page":"1145-1154","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["ABRA"],"prefix":"10.1145","author":[{"given":"Matteo","family":"Riondato","sequence":"first","affiliation":[{"name":"Two Sigma Investments, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eli","family":"Upfal","sequence":"additional","affiliation":[{"name":"Brown University, Providence, RI, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,8,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2014.2307359"},{"key":"e_1_3_2_1_2_1","volume-title":"Stichting Mathematisch Centrum","author":"Anthonisse J. M.","year":"1971","unstructured":"J. M. Anthonisse. The rush in a directed graph. TR BN 9\/71, Stichting Mathematisch Centrum, 1971."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1777879.1777889"},{"key":"e_1_3_2_1_4_1","volume-title":"ESA'15","author":"Bergamini E.","unstructured":"E. Bergamini and H. Meyerhenke. Fully-dynamic approximation of betweenness centrality. ESA'15."},{"key":"e_1_3_2_1_5_1","unstructured":"}BergaminiM15arXivE. Bergamini and H. Meyerhenke. Approximating betweenness centrality in fully-dynamic networks. Internet Mathematics to appear."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2789813.2789825"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1051\/ps:2005018"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/993483"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218127407018403"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/777092.777117"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974010.49"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2791204.2791213"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom-PASSAT.2012.37"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850578.2850580"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492517.2492533"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2419666"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187884"},{"key":"e_1_3_2_1_20_1","unstructured":"J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data 2014."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1809753"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2013.03.017"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5254-2"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-015-0423-0"},{"key":"e_1_3_2_1_25_1","volume-title":"Approximating betweenness centrality in static and dynamic graphswith Rademacher averages (extended version) http:\/\/rionda.to\/papers\/RiondatoUpfal-ABRA-ext.pdf","author":"Riondato M.","year":"2016","unstructured":"M. Riondato and E. Upfal. Approximating betweenness centrality in static and dynamic graphswith Rademacher averages (extended version) http:\/\/rionda.to\/papers\/RiondatoUpfal-ABRA-ext.pdf, 2016."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783265"},{"key":"e_1_3_2_1_27_1","volume-title":"SDM'15","author":"Sar\u00edy\u00fcce A. E.","year":"2015","unstructured":"A. E. Sar\u00edy\u00fcce, E. Saule, K. Kaya, and U. V. \u00c7ataly\u00fcrek. Shattering and compressing networks for betweenness centrality. SDM'15, 2015."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/2621980"},{"key":"e_1_3_2_1_29_1","unstructured":"C. Staudt A. Sazonovs and H. Meyerhenke. NetworKit: A tool suite for high-performance network analysis. Network Science to appear."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/211359"}],"event":{"name":"KDD '16: The 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"San Francisco California USA","acronym":"KDD '16","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2939672.2939770","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2939672.2939770","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2939672.2939770","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:37:52Z","timestamp":1763458672000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2939672.2939770"}},"subtitle":["Approximating Betweenness Centrality in Static and Dynamic Graphs with Rademacher Averages"],"short-title":[],"issued":{"date-parts":[[2016,8,13]]},"references-count":30,"alternative-id":["10.1145\/2939672.2939770","10.1145\/2939672"],"URL":"https:\/\/doi.org\/10.1145\/2939672.2939770","relation":{},"subject":[],"published":{"date-parts":[[2016,8,13]]},"assertion":[{"value":"2016-08-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}