{"id":"https://openalex.org/W2063809699","doi":"https://doi.org/10.1145/2786022","title":"Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates","display_name":"Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates","publication_year":2015,"publication_date":"2015-07-15","ids":{"openalex":"https://openalex.org/W2063809699","doi":"https://doi.org/10.1145/2786022","mag":"2063809699"},"language":"en","primary_location":{"id":"doi:10.1145/2786022","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2786022","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","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/A5070497757","display_name":"Annalisa D\u2019Andrea","orcid":null},"institutions":[{"id":"https://openalex.org/I26415053","display_name":"University of L'Aquila","ror":"https://ror.org/01j9p1r26","country_code":"IT","type":"education","lineage":["https://openalex.org/I26415053"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Annalisa D'Andrea","raw_affiliation_strings":["University of L'Aquila, Italy","[University of L 'Aquila, Italy]"],"affiliations":[{"raw_affiliation_string":"University of L'Aquila, Italy","institution_ids":["https://openalex.org/I26415053"]},{"raw_affiliation_string":"[University of L 'Aquila, Italy]","institution_ids":["https://openalex.org/I26415053"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036014692","display_name":"Mattia D\u2019Emidio","orcid":"https://orcid.org/0000-0001-7833-9520"},"institutions":[{"id":"https://openalex.org/I26415053","display_name":"University of L'Aquila","ror":"https://ror.org/01j9p1r26","country_code":"IT","type":"education","lineage":["https://openalex.org/I26415053"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Mattia D'Emidio","raw_affiliation_strings":["University of L'Aquila, Italy","[University of L 'Aquila, Italy]"],"affiliations":[{"raw_affiliation_string":"University of L'Aquila, Italy","institution_ids":["https://openalex.org/I26415053"]},{"raw_affiliation_string":"[University of L 'Aquila, Italy]","institution_ids":["https://openalex.org/I26415053"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022524777","display_name":"Daniele Frigioni","orcid":"https://orcid.org/0000-0002-2180-8813"},"institutions":[{"id":"https://openalex.org/I26415053","display_name":"University of L'Aquila","ror":"https://ror.org/01j9p1r26","country_code":"IT","type":"education","lineage":["https://openalex.org/I26415053"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Daniele Frigioni","raw_affiliation_strings":["University of L'Aquila, Italy","[University of L 'Aquila, Italy]"],"affiliations":[{"raw_affiliation_string":"University of L'Aquila, Italy","institution_ids":["https://openalex.org/I26415053"]},{"raw_affiliation_string":"[University of L 'Aquila, Italy]","institution_ids":["https://openalex.org/I26415053"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028702811","display_name":"Stefano Leucci","orcid":"https://orcid.org/0000-0002-8848-7006"},"institutions":[{"id":"https://openalex.org/I26415053","display_name":"University of L'Aquila","ror":"https://ror.org/01j9p1r26","country_code":"IT","type":"education","lineage":["https://openalex.org/I26415053"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Stefano Leucci","raw_affiliation_strings":["University of L'Aquila, Italy","[University of L 'Aquila, Italy]"],"affiliations":[{"raw_affiliation_string":"University of L'Aquila, Italy","institution_ids":["https://openalex.org/I26415053"]},{"raw_affiliation_string":"[University of L 'Aquila, Italy]","institution_ids":["https://openalex.org/I26415053"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087770784","display_name":"Guido Proietti","orcid":"https://orcid.org/0000-0003-1009-5552"},"institutions":[{"id":"https://openalex.org/I26415053","display_name":"University of L'Aquila","ror":"https://ror.org/01j9p1r26","country_code":"IT","type":"education","lineage":["https://openalex.org/I26415053"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Guido Proietti","raw_affiliation_strings":["University of L'Aquila, Italy","[University of L 'Aquila, Italy]"],"affiliations":[{"raw_affiliation_string":"University of L'Aquila, Italy","institution_ids":["https://openalex.org/I26415053"]},{"raw_affiliation_string":"[University of L 'Aquila, Italy]","institution_ids":["https://openalex.org/I26415053"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5070497757"],"corresponding_institution_ids":["https://openalex.org/I26415053"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.08096876,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"20","issue":null,"first_page":"1","last_page":"33"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9970999956130981,"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"}},"topics":[{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9970999956130981,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9796000123023987,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6560529470443726},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6400268077850342},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5607084035873413},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.503851592540741},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46283912658691406},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.45150554180145264},{"id":"https://openalex.org/keywords/homogeneous","display_name":"Homogeneous","score":0.43422794342041016},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4230685532093048},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4185147285461426},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3782574534416199},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3164633512496948},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3134889602661133},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1607997715473175},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09362438321113586}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6560529470443726},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6400268077850342},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5607084035873413},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.503851592540741},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46283912658691406},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.45150554180145264},{"id":"https://openalex.org/C66882249","wikidata":"https://www.wikidata.org/wiki/Q169336","display_name":"Homogeneous","level":2,"score":0.43422794342041016},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4230685532093048},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4185147285461426},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3782574534416199},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3164633512496948},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3134889602661133},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1607997715473175},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09362438321113586},{"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.1145/2786022","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2786022","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.550000011920929}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W154362522","https://openalex.org/W191895701","https://openalex.org/W390146837","https://openalex.org/W1599935894","https://openalex.org/W1604909471","https://openalex.org/W1920501755","https://openalex.org/W1975344016","https://openalex.org/W2004317773","https://openalex.org/W2008620264","https://openalex.org/W2014889099","https://openalex.org/W2015725509","https://openalex.org/W2016179297","https://openalex.org/W2023396430","https://openalex.org/W2029706450","https://openalex.org/W2041172083","https://openalex.org/W2049354208","https://openalex.org/W2049639176","https://openalex.org/W2051825184","https://openalex.org/W2063896698","https://openalex.org/W2087989168","https://openalex.org/W2094826544","https://openalex.org/W2112964526","https://openalex.org/W2115106512","https://openalex.org/W2135810626","https://openalex.org/W2143083884","https://openalex.org/W2146583842","https://openalex.org/W2150418461","https://openalex.org/W2169528473","https://openalex.org/W2240997388","https://openalex.org/W2905110430","https://openalex.org/W2952476710","https://openalex.org/W3167683174","https://openalex.org/W4389615664"],"related_works":["https://openalex.org/W1598955744","https://openalex.org/W4384111961","https://openalex.org/W2951710344","https://openalex.org/W2144602163","https://openalex.org/W2204136089","https://openalex.org/W2127985649","https://openalex.org/W4249202279","https://openalex.org/W1555391540","https://openalex.org/W4298161250","https://openalex.org/W2071772558"],"abstract_inverted_index":{"A":[0],"dynamic":[1,91],"graph":[2,19],"algorithm":[3],"is":[4,9,128],"called":[5],"batch":[6,41,238,264],"if":[7],"it":[8],"able":[10,129],"to":[11,112,130,152,205,215],"update":[12,143],"efficiently":[13],"the":[14,33,153,158,169,192,196,217,234,249,257,260,267,285],"solution":[15,282],"of":[16,123,134,155,174,187,219,259,262,266],"a":[17,25,28,45,121,172,175,184,271,280],"given":[18],"problem":[20],"after":[21],"multiple":[22],"updates":[23],"at":[24],"time":[26],"(i.e.,":[27],"batch)":[29],"take":[30],"place":[31],"on":[32,62,183,256,284],"input":[34],"graph.":[35],"In":[36,56],"this":[37,211],"article,":[38],"we":[39,58,222],"study":[40,228],"algorithms":[42,111,126,141,190,232],"for":[43],"maintaining":[44],"single-source":[46],"shortest-path":[47,159],"tree":[48,160],"in":[49,97,104,157,195,199,213,278],"graphs":[50],"with":[51,150,191,203],"positive":[52],"real":[53],"edge":[54,71,81],"weights.":[55],"particular,":[57],"focus":[59],"our":[60,188,220,230,273],"attention":[61],"homogeneous":[63,263],"batches,":[64,87,118],"that":[65,127,161,248],"is,":[66],"either":[67,114],"incremental":[68,115,135],"(containing":[69,79],"only":[70,80],"insertion":[72],"and":[73,83,100,120,136,207,233,246,265],"weight":[74,84],"decrease":[75],"operations)":[76,86],"or":[77,116],"decremental":[78,117,137],"deletion":[82],"increase":[85],"which":[88,198],"model":[89],"realistic":[90],"scenarios":[92],"like":[93],"transient":[94],"vertex":[95],"failures":[96],"communication":[98],"networks":[99],"traffic":[101],"congestion/decongestion":[102],"phenomena":[103],"road":[105],"networks.":[106],"We":[107],"propose":[108],"two":[109,125],"new":[110,189,231],"process":[113,131],"respectively,":[119],"combination":[122],"these":[124,140],"arbitrary":[132],"sequences":[133],"batches.":[138],"All":[139],"are":[142,148,201],"sensitive":[144],";":[145],"namely,":[146],"they":[147],"efficient":[149,236],"respect":[151,204],"number":[154],"vertices":[156],"change":[162],"their":[163,166],"parents":[164],"and/or":[165],"distances":[167],"from":[168],"source":[170],"as":[171],"consequence":[173],"batch.":[176],"This":[177],"makes":[178],"unfeasible":[179],"an":[180,225],"effective":[181],"comparison":[182],"theoretical":[185],"basis":[186,258],"solutions":[193,251],"known":[194],"literature,":[197],"turn":[200],"analyzed":[202],"others":[206],"different":[208],"parameters.":[209],"For":[210],"reason,":[212],"order":[214],"evaluate":[216],"quality":[218],"approach,":[221],"provide":[223],"also":[224],"extensive":[226],"experimental":[227,241],"including":[229],"most":[235],"previous":[237,244],"algorithms.":[239],"Our":[240],"results":[242],"complement":[243],"studies":[245],"show":[247],"various":[250],"can":[252,275],"be":[253,276],"consistently":[254],"ranked":[255],"type":[261],"underlying":[268],"network.":[269],"As":[270],"result,":[272],"work":[274],"helpful":[277],"selecting":[279],"proper":[281],"depending":[283],"specific":[286],"application":[287],"scenario.":[288]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}