{"id":"https://openalex.org/W2284958355","doi":"https://doi.org/10.1080/15427951.2016.1177802","title":"Approximating Betweenness Centrality in Fully Dynamic Networks","display_name":"Approximating Betweenness Centrality in Fully Dynamic Networks","publication_year":2016,"publication_date":"2016-04-22","ids":{"openalex":"https://openalex.org/W2284958355","doi":"https://doi.org/10.1080/15427951.2016.1177802","mag":"2284958355"},"language":"en","primary_location":{"id":"doi:10.1080/15427951.2016.1177802","is_oa":true,"landing_page_url":"https://doi.org/10.1080/15427951.2016.1177802","pdf_url":"https://www.internetmathematicsjournal.com/article/1607.pdf","source":{"id":"https://openalex.org/S19474917","display_name":"Internet Mathematics","issn_l":"1542-7951","issn":["1542-7951","1944-9488"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Internet Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.internetmathematicsjournal.com/article/1607.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033374981","display_name":"Elisabetta Bergamini","orcid":"https://orcid.org/0000-0002-6480-0213"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Elisabetta Bergamini","raw_affiliation_strings":["Institute of Theoretical Informatics, Karlsruhe Institute of Technology (KIT), Am Fasanengarten 5, 76131 Karlsruhe, Germany","Institute of Theoretical Informatics, Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Theoretical Informatics, Karlsruhe Institute of Technology (KIT), Am Fasanengarten 5, 76131 Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]},{"raw_affiliation_string":"Institute of Theoretical Informatics, Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020196859","display_name":"Henning Meyerhenke","orcid":"https://orcid.org/0000-0002-7769-726X"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Henning Meyerhenke","raw_affiliation_strings":["Institute of Theoretical Informatics, Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Theoretical Informatics, Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5033374981"],"corresponding_institution_ids":["https://openalex.org/I102335020"],"apc_list":null,"apc_paid":null,"fwci":3.9767,"has_fulltext":true,"cited_by_count":34,"citation_normalized_percentile":{"value":0.94010527,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":"12","issue":"5","first_page":"281","last_page":"314"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9861000180244446,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9855999946594238,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/betweenness-centrality","display_name":"Betweenness centrality","score":0.9768642783164978},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7244541049003601},{"id":"https://openalex.org/keywords/approximation-error","display_name":"Approximation error","score":0.6735457181930542},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6599254608154297},{"id":"https://openalex.org/keywords/centrality","display_name":"Centrality","score":0.6123071908950806},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.60831618309021},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5286543965339661},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4860985279083252},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4365190863609314},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38808637857437134},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3209882080554962},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3062475621700287},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.29820990562438965},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.21254822611808777}],"concepts":[{"id":"https://openalex.org/C117045392","wikidata":"https://www.wikidata.org/wiki/Q4899215","display_name":"Betweenness centrality","level":3,"score":0.9768642783164978},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7244541049003601},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.6735457181930542},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6599254608154297},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.6123071908950806},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.60831618309021},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5286543965339661},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4860985279083252},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4365190863609314},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38808637857437134},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3209882080554962},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3062475621700287},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.29820990562438965},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21254822611808777}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/15427951.2016.1177802","is_oa":true,"landing_page_url":"https://doi.org/10.1080/15427951.2016.1177802","pdf_url":"https://www.internetmathematicsjournal.com/article/1607.pdf","source":{"id":"https://openalex.org/S19474917","display_name":"Internet Mathematics","issn_l":"1542-7951","issn":["1542-7951","1944-9488"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Internet Mathematics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1080/15427951.2016.1177802","is_oa":true,"landing_page_url":"https://doi.org/10.1080/15427951.2016.1177802","pdf_url":"https://www.internetmathematicsjournal.com/article/1607.pdf","source":{"id":"https://openalex.org/S19474917","display_name":"Internet Mathematics","issn_l":"1542-7951","issn":["1542-7951","1944-9488"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Internet Mathematics","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.4399999976158142,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G3633743130","display_name":null,"funder_award_id":"SPP 1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G5398132153","display_name":null,"funder_award_id":"DFG grant","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G8909796238","display_name":null,"funder_award_id":"SPP 1736","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2284958355.pdf","grobid_xml":"https://content.openalex.org/works/W2284958355.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W131619556","https://openalex.org/W160678529","https://openalex.org/W324754135","https://openalex.org/W1029409534","https://openalex.org/W1527104720","https://openalex.org/W1570371166","https://openalex.org/W1603540962","https://openalex.org/W1604909471","https://openalex.org/W1627599966","https://openalex.org/W1971937094","https://openalex.org/W1996014455","https://openalex.org/W2029706450","https://openalex.org/W2036603787","https://openalex.org/W2036977244","https://openalex.org/W2038084411","https://openalex.org/W2067674168","https://openalex.org/W2076572897","https://openalex.org/W2088961699","https://openalex.org/W2094826544","https://openalex.org/W2108341980","https://openalex.org/W2111708605","https://openalex.org/W2133503202","https://openalex.org/W2171707538","https://openalex.org/W2240997388","https://openalex.org/W2280352275","https://openalex.org/W2401915092","https://openalex.org/W2963957156","https://openalex.org/W4210901545","https://openalex.org/W4211173878"],"related_works":["https://openalex.org/W1973509935","https://openalex.org/W4389076551","https://openalex.org/W2097992793","https://openalex.org/W2107855069","https://openalex.org/W2611574733","https://openalex.org/W2241641394","https://openalex.org/W2140653560","https://openalex.org/W2284958355","https://openalex.org/W2950077880","https://openalex.org/W4301487118"],"abstract_inverted_index":{"Betweenness":[0],"is":[1,181,206],"a":[2,11,68,132],"well-known":[3],"centrality":[4,64],"measure":[5],"that":[6,52,161],"ranks":[7],"the":[8,40,61,72,86,95,99,109,142,178,186,202],"nodes":[9,205,212],"of":[10,42,48,108,134,148,155,175,191,204],"network":[12],"according":[13],"to":[14,85,144,169,172],"their":[15],"participation":[16],"in":[17,25,50,112,128,150,189,209],"shortest":[18,126],"paths.":[19],"Because":[20],"exact":[21],"computations":[22],"are":[23,141],"prohibitive":[24],"large":[26],"networks,":[27],"several":[28,173],"approximation":[29,65,74,88,107,179,199],"algorithms":[30,44,66,140,163],"have":[31,38],"been":[32],"proposed.":[33],"Besides":[34],"that,":[35],"recent":[36],"years":[37],"seen":[39],"publication":[41],"dynamic":[43,77,102,151],"for":[45,76,104,123,196,211],"efficient":[46],"recomputation":[47],"betweenness":[49,63,149],"networks":[51,152],"change":[53],"over":[54],"time.":[55],"In":[56],"this":[57],"article,":[58],"we":[59],"propose":[60],"first":[62,100,143],"with":[67,119,153,213],"provable":[69],"guarantee":[70,188],"on":[71,94],"maximum":[73],"error":[75,200],"networks.":[78],"Several":[79],"new":[80,91],"intermediate":[81],"algorithmic":[82],"results":[83],"contribute":[84],"respective":[87],"algorithms:":[89],"(i)":[90],"upper":[92],"bounds":[93],"vertex":[96,110],"diameter,":[97],"(ii)":[98],"fully":[101],"algorithm":[103,118],"updating":[105,124],"an":[106,117],"diameter":[111],"undirected":[113],"graphs,":[114],"and":[115],"(iii)":[116],"lower":[120],"time":[121],"complexity":[122],"single-source":[125],"paths":[127],"unweighted":[129],"graphs":[130],"after":[131],"batch":[133],"edge":[135],"actions.":[136],"Using":[137],"approximation,":[138],"our":[139,162],"make":[145],"in-memory":[146],"computation":[147],"millions":[154],"edges":[156],"feasible.":[157],"Our":[158],"experiments":[159],"show":[160],"can":[164],"achieve":[165],"substantial":[166],"speedups":[167],"compared":[168],"recomputation,":[170],"up":[171],"orders":[174],"magnitude.":[176],"Moreover,":[177],"accuracy":[180],"usually":[182],"significantly":[183],"better":[184],"than":[185],"theoretical":[187],"terms":[190],"absolute":[192],"error.":[193],"More":[194],"importantly,":[195],"reasonably":[197],"small":[198],"thresholds,":[201],"rank":[203],"well":[207],"preserved,":[208],"particular":[210],"high":[214],"betweenness.":[215]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}