{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T15:26:07Z","timestamp":1783178767501,"version":"3.54.6"},"reference-count":55,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1109\/infocom41043.2020.9155354","type":"proceedings-article","created":{"date-parts":[[2020,8,4]],"date-time":"2020-08-04T22:29:35Z","timestamp":1596580175000},"page":"337-346","source":"Crossref","is-referenced-by-count":7,"title":["Simple and Fast Distributed Computation of Betweenness Centrality"],"prefix":"10.1109","author":[{"given":"Pierluigi","family":"Crescenzi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre","family":"Fraigniaud","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ami","family":"Paz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","article-title":"Distributed exact weighted all-pairs shortest paths in near-linear time","author":"bernstein","year":"2018","journal-title":"STOC"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.91"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2016.89"},{"key":"ref32","article-title":"Distributed algorithms for directed betweenness centrality and all pairs shortest paths","author":"pontecorvi","year":"2018","journal-title":"Tech Rep"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.87.278701"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935812"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484262"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31585-5_58"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332504"},{"key":"ref28","article-title":"Decentralized algorithms for evaluating centrality in complex network","author":"zweig","year":"2003","journal-title":"Tech Rep"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2014.6858727"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2007.11.001"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2010.5634439"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"ref20","article-title":"Distributed estimation and control of node centrality in undirected asymmetric networks","author":"montijano","year":"2019","journal-title":"Tech Rep"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-015-0423-0"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnu015"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3293883.3295729"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3208351"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2013.6759856"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2604373"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1137\/0109045"},{"key":"ref51","doi-asserted-by":"crossref","first-page":"65103(r)","DOI":"10.1103\/PhysRevE.68.065103","article-title":"Self-similar community structure in a network of human interactions","volume":"68","author":"guimera","year":"2033","journal-title":"Physical Review E"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2016.89"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.016132"},{"key":"ref53","article-title":"9th DIMACS Implementation Challenge - Shortest Paths","year":"0"},{"key":"ref52","article-title":"SNAP Datasets: Stanford large network dataset collection","author":"leskovec","year":"2014"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2013.06.018"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486345"},{"key":"ref40","article-title":"Quadratic and near-quadratic lower bounds for the congest model","author":"censor-hillel","year":"2017","journal-title":"Disc"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77004-6_10"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2012.79"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1142\/S0218127407018403"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972887.9"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31955-9_4"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/NSW.2011.6004633"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2016.7842049"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13657-3_12"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1734213.1734219"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2012.6393516"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.186"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524407"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2014.07.026"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2015.2494039"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2713361"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"ref45","author":"peterson","year":"2003","journal-title":"Computer Networks A Systems Approach"},{"key":"ref48","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs. i","volume":"6","author":"erd\u00f6s","year":"1959","journal-title":"Publicationes Mathematicae"},{"key":"ref47","article-title":"NetworkX. Software for complex networks","author":"hagberg","year":"2019"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_14"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973754.12"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2419666"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.14778\/2850578.2850580"}],"event":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications","location":"Toronto, ON, Canada","start":{"date-parts":[[2020,7,6]]},"end":{"date-parts":[[2020,7,9]]}},"container-title":["IEEE INFOCOM 2020 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9146503\/9155217\/09155354.pdf?arnumber=9155354","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,5]],"date-time":"2023-10-05T08:22:33Z","timestamp":1696494153000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9155354\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":55,"URL":"https:\/\/doi.org\/10.1109\/infocom41043.2020.9155354","relation":{},"subject":[],"published":{"date-parts":[[2020,7]]}}}