{"id":"https://openalex.org/W2005395736","doi":"https://doi.org/10.1002/net.3230080406","title":"A new shortest path updating algorithm","display_name":"A new shortest path updating algorithm","publication_year":1978,"publication_date":"1978-12-01","ids":{"openalex":"https://openalex.org/W2005395736","doi":"https://doi.org/10.1002/net.3230080406","mag":"2005395736"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230080406","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230080406","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5101825973","display_name":"Satoshi Goto","orcid":"https://orcid.org/0000-0002-6387-048X"},"institutions":[{"id":"https://openalex.org/I173263115","display_name":"Nippon Electric Glass (Japan)","ror":"https://ror.org/02ty1mz57","country_code":"JP","type":"company","lineage":["https://openalex.org/I173263115"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"S. Goto","raw_affiliation_strings":["Nippon Electric Co., Ltd. Kawasaki City, Kanagawa, Japan"],"affiliations":[{"raw_affiliation_string":"Nippon Electric Co., Ltd. Kawasaki City, Kanagawa, Japan","institution_ids":["https://openalex.org/I173263115"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088660554","display_name":"Alberto Sangiovanni\u2010Vincentelli","orcid":"https://orcid.org/0000-0003-1298-8389"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Sangiovanni\u2010Vincentelli","raw_affiliation_strings":["University of California Berkeley, California","University of California, Berkeley, California"],"affiliations":[{"raw_affiliation_string":"University of California Berkeley, California","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"University of California, Berkeley, California","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101825973"],"corresponding_institution_ids":["https://openalex.org/I173263115"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.4461,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.78120978,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"8","issue":"4","first_page":"341","last_page":"372"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9951000213623047,"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.9951000213623047,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9914000034332275,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9829000234603882,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.6885064840316772},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6045482754707336},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5795925855636597},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5150165557861328},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4967239499092102},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46540170907974243},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.4466806948184967},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.42992785573005676},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3246195912361145},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11130279302597046}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6885064840316772},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6045482754707336},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5795925855636597},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5150165557861328},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4967239499092102},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46540170907974243},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.4466806948184967},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.42992785573005676},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3246195912361145},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11130279302597046},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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.1002/net.3230080406","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230080406","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W1993631148","https://openalex.org/W1996548298","https://openalex.org/W2014211132","https://openalex.org/W2069535670","https://openalex.org/W2071845176","https://openalex.org/W2107681157","https://openalex.org/W2130644458","https://openalex.org/W2144050074","https://openalex.org/W2157529519","https://openalex.org/W2160211628","https://openalex.org/W2169528473","https://openalex.org/W2171123215","https://openalex.org/W2227557434","https://openalex.org/W2316453713","https://openalex.org/W7058325137"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W4293054712","https://openalex.org/W2767202586","https://openalex.org/W2375775343","https://openalex.org/W2388654557","https://openalex.org/W2360981904","https://openalex.org/W2365712669","https://openalex.org/W2349797546","https://openalex.org/W2161960576","https://openalex.org/W2366342492"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"new":[2],"algorithm":[3,25,89],"for":[4,41,54,95],"updating":[5],"shortest":[6,58],"paths":[7],"from":[8],"all":[9],"vertices":[10,15,74],"to":[11,81],"a":[12,17,29,78],"set":[13],"of":[14,19,47,73],"following":[16],"decreasing\u2010length\u2010modification":[18],"some":[20],"arcs,":[21],"is":[22,26,61,69,77,92],"presented.":[23],"The":[24,45,88],"based":[27],"on":[28],"formula":[30,40],"which":[31,84],"has":[32],"an":[33],"algebraic":[34],"analogy":[35],"with":[36,99],"the":[37,56,70,82],"well\u2010known":[38],"Householder":[39],"inverting":[42],"modified":[43,57],"matrices.":[44],"number":[46,72],"operations":[48],"(i.e.,":[49],"additions":[50],"and":[51,75],"comparisons)":[52],"required":[53],"solving":[55,96],"path":[59],"problem":[60],"estimated":[62],"as":[63],"0(mn":[64],"2":[65],"),":[66],"where":[67],"n":[68],"overall":[71],"m":[76],"parameter":[79],"related":[80],"arcs":[83],"have":[85],"been":[86],"updated.":[87],"proposed":[90],"here":[91],"particularly":[93],"powerful":[94],"large\u2010scale":[97],"networks":[98],"sparse":[100],"structure.":[101]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}