{"id":"https://openalex.org/W2094826544","doi":"https://doi.org/10.1007/pl00009224","title":"Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees","display_name":"Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees","publication_year":1998,"publication_date":"1998-11-01","ids":{"openalex":"https://openalex.org/W2094826544","doi":"https://doi.org/10.1007/pl00009224","mag":"2094826544"},"language":"en","primary_location":{"id":"doi:10.1007/pl00009224","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00009224","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/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":true,"raw_author_name":"D. Frigioni","raw_affiliation_strings":["Dipartimento di Matematica Pura ed Applicata, Universit\u00e0 di L'Aquila, via Vetoio, I-67010 Coppito (AQ), Italy.  frigioni@univaq.it., , , , , , IT","Dipartimento di Matematica Pura ed Applicata, Universit\u00e0 di L'Aquila, via Vetoio, I-67010 Coppito (AQ), Italy. frigioni@univaq.it., IT"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica Pura ed Applicata, Universit\u00e0 di L'Aquila, via Vetoio, I-67010 Coppito (AQ), Italy.  frigioni@univaq.it., , , , , , IT","institution_ids":["https://openalex.org/I26415053"]},{"raw_affiliation_string":"Dipartimento di Matematica Pura ed Applicata, Universit\u00e0 di L'Aquila, via Vetoio, I-67010 Coppito (AQ), Italy. frigioni@univaq.it., IT","institution_ids":["https://openalex.org/I26415053"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064823807","display_name":"Alberto Marchetti-Spaccamela","orcid":"https://orcid.org/0000-0002-7991-4416"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"A. Marchetti-Spaccamela","raw_affiliation_strings":["Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma ``La Sapienza'', Via Salaria 113, 00198 Roma, Italy. alberto@dis.uniroma1.it, nanni@dis.uniroma1.it., , , , , , IT","Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma ``La Sapienza'', Via Salaria 113, 00198 Roma, Italy. alberto@dis.uniroma1.it, nanni@dis.uniroma1.it., IT"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma ``La Sapienza'', Via Salaria 113, 00198 Roma, Italy. alberto@dis.uniroma1.it, nanni@dis.uniroma1.it., , , , , , IT","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma ``La Sapienza'', Via Salaria 113, 00198 Roma, Italy. alberto@dis.uniroma1.it, nanni@dis.uniroma1.it., IT","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086753756","display_name":"Umberto Nanni","orcid":"https://orcid.org/0000-0002-2196-6037"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"U. Nanni","raw_affiliation_strings":["Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma ``La Sapienza'', Via Salaria 113, 00198 Roma, Italy. alberto@dis.uniroma1.it, nanni@dis.uniroma1.it., , , , , , IT","Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma ``La Sapienza'', Via Salaria 113, 00198 Roma, Italy. alberto@dis.uniroma1.it, nanni@dis.uniroma1.it., IT"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma ``La Sapienza'', Via Salaria 113, 00198 Roma, Italy. alberto@dis.uniroma1.it, nanni@dis.uniroma1.it., , , , , , IT","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma ``La Sapienza'', Via Salaria 113, 00198 Roma, Italy. alberto@dis.uniroma1.it, nanni@dis.uniroma1.it., IT","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5022524777"],"corresponding_institution_ids":["https://openalex.org/I26415053"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":3.0606,"has_fulltext":false,"cited_by_count":72,"citation_normalized_percentile":{"value":0.91851461,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"22","issue":"3","first_page":"250","last_page":"274"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9968000054359436,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9965000152587891,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.6567859649658203},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.640119731426239},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6034020185470581},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5535269975662231},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5519758462905884},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5468825697898865},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5451974868774414},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5087447762489319},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5011680126190186},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46165570616722107},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4410534203052521},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4088097810745239},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4002707898616791},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35223162174224854},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3283935487270355},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2457398772239685}],"concepts":[{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.6567859649658203},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.640119731426239},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6034020185470581},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5535269975662231},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5519758462905884},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5468825697898865},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5451974868774414},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5087447762489319},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5011680126190186},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46165570616722107},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4410534203052521},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4088097810745239},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4002707898616791},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35223162174224854},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3283935487270355},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2457398772239685},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/pl00009224","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00009224","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:iris.uniroma1.it:11573/70297","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/70297","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:iris.uniroma1.it:11573/92026","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/92026","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W205976932","https://openalex.org/W1499442191","https://openalex.org/W1545707055","https://openalex.org/W1979750070","https://openalex.org/W1980248515","https://openalex.org/W1987374783","https://openalex.org/W1987927249","https://openalex.org/W1989111470","https://openalex.org/W2022783258","https://openalex.org/W2029706450","https://openalex.org/W2034501206","https://openalex.org/W2038643780","https://openalex.org/W2042706982","https://openalex.org/W2045102550","https://openalex.org/W2120424341","https://openalex.org/W2169528473","https://openalex.org/W2799004609"],"related_works":["https://openalex.org/W1511821218","https://openalex.org/W1587078595","https://openalex.org/W2124176527","https://openalex.org/W2985636744","https://openalex.org/W2125058377","https://openalex.org/W2465927132","https://openalex.org/W4387667086","https://openalex.org/W4301463689","https://openalex.org/W2605313623","https://openalex.org/W2133160845"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}