{"id":"https://openalex.org/W2761072891","doi":"https://doi.org/10.1201/9781003033707-10","title":"Computing Top-k Closeness Centrality in Fully Dynamic Graphs","display_name":"Computing Top-k Closeness Centrality in Fully Dynamic Graphs","publication_year":2022,"publication_date":"2022-05-26","ids":{"openalex":"https://openalex.org/W2761072891","doi":"https://doi.org/10.1201/9781003033707-10","mag":"2761072891"},"language":"en","primary_location":{"id":"doi:10.1201/9781003033707-10","is_oa":true,"landing_page_url":"https://doi.org/10.1201/9781003033707-10","pdf_url":"https://api.taylorfrancis.com/content/chapters/edit/download?identifierName=doi&identifierValue=10.1201/9781003033707-10&type=chapterpdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Massive Graph Analytics","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://api.taylorfrancis.com/content/chapters/edit/download?identifierName=doi&identifierValue=10.1201/9781003033707-10&type=chapterpdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077653773","display_name":"Eugenio Angriman","orcid":"https://orcid.org/0000-0002-3160-1509"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Eugenio Angriman","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023024040","display_name":"Patrick Bisenius","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Patrick Bisenius","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033374981","display_name":"Elisabetta Bergamini","orcid":"https://orcid.org/0000-0002-6480-0213"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Elisabetta Bergamini","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5020196859","display_name":"Henning Meyerhenke","orcid":"https://orcid.org/0000-0002-7769-726X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Henning Meyerhenke","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5077653773"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2895,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.84719536,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"161","last_page":"192"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9994000196456909,"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.9994000196456909,"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/T11478","display_name":"Caching and Content Delivery","score":0.9771000146865845,"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"}},{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9764999747276306,"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/closeness","display_name":"Closeness","score":0.8267003297805786},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.6636240482330322},{"id":"https://openalex.org/keywords/centrality","display_name":"Centrality","score":0.6498908996582031},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6345921754837036},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5977826118469238},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5800005793571472},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5136532187461853},{"id":"https://openalex.org/keywords/dynamic-network-analysis","display_name":"Dynamic network analysis","score":0.44071725010871887},{"id":"https://openalex.org/keywords/betweenness-centrality","display_name":"Betweenness centrality","score":0.42882779240608215},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35134756565093994},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2645813822746277},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2336290180683136},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.16378578543663025},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12147402763366699},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07950186729431152}],"concepts":[{"id":"https://openalex.org/C2779545769","wikidata":"https://www.wikidata.org/wiki/Q5135364","display_name":"Closeness","level":2,"score":0.8267003297805786},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.6636240482330322},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.6498908996582031},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6345921754837036},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5977826118469238},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5800005793571472},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5136532187461853},{"id":"https://openalex.org/C13540734","wikidata":"https://www.wikidata.org/wiki/Q5318996","display_name":"Dynamic network analysis","level":2,"score":0.44071725010871887},{"id":"https://openalex.org/C117045392","wikidata":"https://www.wikidata.org/wiki/Q4899215","display_name":"Betweenness centrality","level":3,"score":0.42882779240608215},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35134756565093994},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2645813822746277},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2336290180683136},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.16378578543663025},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12147402763366699},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07950186729431152},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1201/9781003033707-10","is_oa":true,"landing_page_url":"https://doi.org/10.1201/9781003033707-10","pdf_url":"https://api.taylorfrancis.com/content/chapters/edit/download?identifierName=doi&identifierValue=10.1201/9781003033707-10&type=chapterpdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Massive Graph Analytics","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.1201/9781003033707-10","is_oa":true,"landing_page_url":"https://doi.org/10.1201/9781003033707-10","pdf_url":"https://api.taylorfrancis.com/content/chapters/edit/download?identifierName=doi&identifierValue=10.1201/9781003033707-10&type=chapterpdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Massive Graph Analytics","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6052429835","display_name":null,"funder_award_id":"(DFG)","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G8224790471","display_name":null,"funder_award_id":"ME 3619/3-1","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/W2761072891.pdf","grobid_xml":"https://content.openalex.org/works/W2761072891.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W1536060130","https://openalex.org/W1605385825","https://openalex.org/W1876468466","https://openalex.org/W1968023964","https://openalex.org/W1974640488","https://openalex.org/W1986637826","https://openalex.org/W1997310799","https://openalex.org/W2025844353","https://openalex.org/W2048468623","https://openalex.org/W2049354208","https://openalex.org/W2088961699","https://openalex.org/W2117260657","https://openalex.org/W2259760037","https://openalex.org/W2284958355","https://openalex.org/W2295412517","https://openalex.org/W2535471595","https://openalex.org/W2567974767","https://openalex.org/W2608205683","https://openalex.org/W2950693886","https://openalex.org/W2963794747","https://openalex.org/W3098284691","https://openalex.org/W4232240770","https://openalex.org/W4237078129","https://openalex.org/W4297729445","https://openalex.org/W4297813505","https://openalex.org/W4301259450","https://openalex.org/W6649706673","https://openalex.org/W6785270668"],"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/W2348831795","https://openalex.org/W2514739320","https://openalex.org/W4312461432"],"abstract_inverted_index":{"Closeness":[0],"is":[1,17,28],"a":[2],"widely-studied":[3],"centrality":[4],"measure.":[5],"Since":[6],"it":[7,27],"requires":[8],"all":[9,15,40,64],"pairwise":[10],"distances,":[11],"computing":[12,48,61],"closeness":[13,41,54,62],"for":[14,19,24,63],"nodes":[16,37,51,65],"infeasible":[18],"large":[20],"real-world":[21,67],"networks.":[22,68],"However,":[23],"many":[25],"applications,":[26],"only":[29],"necessary":[30],"to":[31],"find":[32],"the":[33,49],"k":[34],"most":[35],"central":[36],"and":[38],"not":[39],"values.":[42],"Prior":[43],"work":[44],"has":[45],"shown":[46],"that":[47],"top-k":[50],"with":[52],"highest":[53],"can":[55],"be":[56],"done":[57],"much":[58],"faster":[59],"than":[60],"in":[66]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}