{"id":"https://openalex.org/W2767282975","doi":"https://doi.org/10.1109/tkde.2017.2772233","title":"Efficient Maintenance of Shortest Distances in Dynamic Graphs","display_name":"Efficient Maintenance of Shortest Distances in Dynamic Graphs","publication_year":2017,"publication_date":"2017-11-10","ids":{"openalex":"https://openalex.org/W2767282975","doi":"https://doi.org/10.1109/tkde.2017.2772233","mag":"2767282975"},"language":"en","primary_location":{"id":"doi:10.1109/tkde.2017.2772233","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2017.2772233","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031964906","display_name":"Sergio Greco","orcid":"https://orcid.org/0000-0003-2966-3484"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Sergio Greco","raw_affiliation_strings":["DIMES Department, University of Calabria, Rende, CS, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DIMES Department, University of Calabria, Rende, CS, Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039727555","display_name":"Cristian Molinaro","orcid":"https://orcid.org/0000-0003-4103-1084"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Cristian Molinaro","raw_affiliation_strings":["DIMES Department, University of Calabria, Rende, CS, Italy"],"raw_orcid":"https://orcid.org/0000-0003-4103-1084","affiliations":[{"raw_affiliation_string":"DIMES Department, University of Calabria, Rende, CS, Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091798914","display_name":"Chiara Pulice","orcid":"https://orcid.org/0000-0001-5449-9044"},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chiara Pulice","raw_affiliation_strings":["Department of Computer Science, Dartmouth College, Hanover, NH"],"raw_orcid":"https://orcid.org/0000-0001-5449-9044","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Dartmouth College, Hanover, NH","institution_ids":["https://openalex.org/I107672454"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.548,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.66214593,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"30","issue":"3","first_page":"474","last_page":"487"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9986000061035156,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/computer-science","display_name":"Computer science","score":0.8496811389923096},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4803429841995239},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4690841734409332},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45398133993148804},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3834128975868225},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.26392775774002075}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8496811389923096},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4803429841995239},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4690841734409332},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45398133993148804},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3834128975868225},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.26392775774002075},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tkde.2017.2772233","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2017.2772233","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320319077","display_name":"Society for the Study of School Psychology","ror":"https://ror.org/00gz9xf10"},{"id":"https://openalex.org/F4320332878","display_name":"Society for Personality and Social Psychology","ror":"https://ror.org/04dkzbv90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":66,"referenced_works":["https://openalex.org/W1496385246","https://openalex.org/W1499442191","https://openalex.org/W1512819151","https://openalex.org/W1542191788","https://openalex.org/W1554407673","https://openalex.org/W1810931192","https://openalex.org/W1829285201","https://openalex.org/W1964653060","https://openalex.org/W1975344016","https://openalex.org/W1982440947","https://openalex.org/W1982943597","https://openalex.org/W1984336731","https://openalex.org/W1989632610","https://openalex.org/W1990589334","https://openalex.org/W1991778515","https://openalex.org/W1996982345","https://openalex.org/W2005945380","https://openalex.org/W2006097619","https://openalex.org/W2008570937","https://openalex.org/W2012670464","https://openalex.org/W2015725509","https://openalex.org/W2019003829","https://openalex.org/W2022322548","https://openalex.org/W2028757431","https://openalex.org/W2035586680","https://openalex.org/W2037034819","https://openalex.org/W2041916017","https://openalex.org/W2048098617","https://openalex.org/W2049354208","https://openalex.org/W2051716170","https://openalex.org/W2058426370","https://openalex.org/W2067210069","https://openalex.org/W2081863845","https://openalex.org/W2084888995","https://openalex.org/W2094515718","https://openalex.org/W2096304152","https://openalex.org/W2098636939","https://openalex.org/W2111708605","https://openalex.org/W2118446779","https://openalex.org/W2123966888","https://openalex.org/W2126166149","https://openalex.org/W2137152603","https://openalex.org/W2142126162","https://openalex.org/W2146583842","https://openalex.org/W2148207323","https://openalex.org/W2152776677","https://openalex.org/W2154713079","https://openalex.org/W2156431918","https://openalex.org/W2159394589","https://openalex.org/W2169528473","https://openalex.org/W2172107427","https://openalex.org/W2194288565","https://openalex.org/W2276989614","https://openalex.org/W2296659056","https://openalex.org/W2423358376","https://openalex.org/W2468419702","https://openalex.org/W2471659732","https://openalex.org/W2538876901","https://openalex.org/W2623150993","https://openalex.org/W2764587448","https://openalex.org/W3022326557","https://openalex.org/W3098530417","https://openalex.org/W6648078101","https://openalex.org/W6648601433","https://openalex.org/W6674540033","https://openalex.org/W6697075189"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2350741829","https://openalex.org/W2530322880"],"abstract_inverted_index":{"Computing":[0],"shortest":[1,29,47],"distances":[2,30,48],"is":[3,25],"a":[4],"central":[5],"task":[6],"in":[7,49,80],"many":[8],"domains.":[9],"The":[10,66],"growing":[11],"number":[12],"of":[13,44,60,86,94],"applications":[14],"dealing":[15],"with":[16],"dynamic":[17,50],"graphs":[18],"calls":[19],"for":[20,116],"incremental":[21,55],"algorithms,":[22],"as":[23],"it":[24],"impractical":[26],"to":[27,57],"recompute":[28],"from":[31],"scratch":[32],"every":[33],"time":[34],"updates":[35],"occur.":[36],"In":[37],"this":[38],"paper,":[39],"we":[40],"address":[41],"the":[42,95],"problem":[43],"maintaining":[45],"all-pairs":[46],"graphs.":[51],"We":[52,90],"propose":[53],"efficient":[54],"algorithms":[56,108],"process":[58],"sequences":[59],"edge":[61],"deletions/insertions/updates":[62],"and":[63,83,119],"vertex":[64],"deletions/insertions.":[65],"proposed":[67,96],"approach":[68,121],"relies":[69],"on":[70,84,100],"some":[71],"general":[72],"operators":[73],"that":[74,105],"can":[75],"be":[76],"easily":[77],"\u201cinstantiated\u201d":[78],"both":[79],"main":[81],"memory":[82],"top":[85],"different":[87],"underlying":[88],"DBMSs.":[89],"provide":[91],"complexity":[92],"analyses":[93],"algorithms.":[97,125],"Experimental":[98],"results":[99],"several":[101],"real-world":[102],"datasets":[103],"show":[104],"current":[106],"main-memory":[107],"become":[109],"soon":[110],"impractical,":[111],"disk-based":[112],"ones":[113],"are":[114],"needed":[115],"larger":[117],"graphs,":[118],"our":[120],"significantly":[122],"outperforms":[123],"state-of-the-art":[124]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}