{"id":"https://openalex.org/W2071845176","doi":"https://doi.org/10.1137/0204032","title":"On Finding and Updating Spanning Trees and Shortest Paths","display_name":"On Finding and Updating Spanning Trees and Shortest Paths","publication_year":1975,"publication_date":"1975-09-01","ids":{"openalex":"https://openalex.org/W2071845176","doi":"https://doi.org/10.1137/0204032","mag":"2071845176"},"language":"en","primary_location":{"id":"doi:10.1137/0204032","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0204032","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5041813088","display_name":"Philip M. Spira","orcid":null},"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":"P. M. Spira","raw_affiliation_strings":["\" Department of Electrical Engineering and Computer Sciences and the Electronics Research Laboratory, University of California at Berkeley Berkeley, California 94720","Now at Bell Laboratories, Naperville, Illinois 60540. 375","Department of Electrical Engineering and Computer Sciences and the Electronics Research Laboratory, University of California at Berkeley, Berkeley, California"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\" Department of Electrical Engineering and Computer Sciences and the Electronics Research Laboratory, University of California at Berkeley Berkeley, California 94720","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"Now at Bell Laboratories, Naperville, Illinois 60540. 375","institution_ids":[]},{"raw_affiliation_string":"Department of Electrical Engineering and Computer Sciences and the Electronics Research Laboratory, University of California at Berkeley, Berkeley, California","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5104198782","display_name":"Aimin Pan","orcid":"https://orcid.org/0009-0004-9823-1436"},"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. Pan","raw_affiliation_strings":["\" Department of Electrical Engineering and Computer Sciences and the Electronics Research Laboratory, University of California at Berkeley Berkeley, California 94720","Now at Bell Laboratories, Naperville, Illinois 60540. 375"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\" Department of Electrical Engineering and Computer Sciences and the Electronics Research Laboratory, University of California at Berkeley Berkeley, California 94720","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"Now at Bell Laboratories, Naperville, Illinois 60540. 375","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":2.4593,"has_fulltext":false,"cited_by_count":139,"citation_normalized_percentile":{"value":0.89703316,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"4","issue":"3","first_page":"375","last_page":"380"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9983000159263611,"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.9983000159263611,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973999857902527,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9961000084877014,"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/spanning-tree","display_name":"Spanning tree","score":0.8704814314842224},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.7986081838607788},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7627274394035339},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6678042411804199},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.6151682138442993},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6125496029853821},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.587142288684845},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.5664134621620178},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5579977035522461},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.5545192360877991},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5487306118011475},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.5242557525634766},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5015895366668701},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.4980142116546631},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.47844603657722473},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.47196921706199646},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.4628220498561859},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4568297863006592},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4530262351036072},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40495365858078003},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23502472043037415},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.21813705563545227},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.10078302025794983}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8704814314842224},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.7986081838607788},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7627274394035339},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6678042411804199},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.6151682138442993},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6125496029853821},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.587142288684845},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5664134621620178},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5579977035522461},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.5545192360877991},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5487306118011475},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.5242557525634766},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5015895366668701},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.4980142116546631},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.47844603657722473},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.47196921706199646},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.4628220498561859},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4568297863006592},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4530262351036072},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40495365858078003},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23502472043037415},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.21813705563545227},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.10078302025794983},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0204032","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0204032","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.303.727","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.303.727","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ics.forth.gr/~lourakis/10.1137.0204032.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W2017927472","https://openalex.org/W2027580688","https://openalex.org/W2028627293","https://openalex.org/W2118382442","https://openalex.org/W2169528473"],"related_works":["https://openalex.org/W2943635264","https://openalex.org/W2092979316","https://openalex.org/W3081212354","https://openalex.org/W2353822696","https://openalex.org/W1576317141","https://openalex.org/W2281826919","https://openalex.org/W2130375301","https://openalex.org/W2589768050","https://openalex.org/W2020381385","https://openalex.org/W2071845176"],"abstract_inverted_index":{"We":[0,14,51],"consider":[1,52],"one":[2],"origin":[3],"shortest":[4,61],"path":[5,62],"and":[6,60],"minimum":[7,110],"spanning":[8,58,91,111],"tree":[9,31,59,92,112],"computations":[10],"in":[11,97],"weighted":[12],"graphs.":[13],"give":[15],"a":[16,30,90,100],"lower":[17],"bound":[18],"on":[19],"the":[20,26,42,53,65,70,81],"number":[21,43],"of":[22,25,36,44],"analytic":[23],"functions":[24],"input":[27],"computed":[28],"by":[29],"program":[32],"which":[33,47],"solves":[34],"either":[35],"these":[37],"problems":[38],"equal":[39],"to":[40,56,105],"half":[41],"worst-case":[45],"comparisons":[46],"well-known":[48],"algorithms":[49,77],"attain.":[50],"work":[54],"necessary":[55],"update":[57],"solutions":[63],"when":[64,99],"graph":[66,108],"is":[67,88,103,113],"altered":[68],"after":[69],"computation":[71],"has":[72],"terminated.":[73],"Optimal":[74],"or":[75],"near-optimal":[76],"are":[78],"attained":[79],"for":[80],"cases":[82],"considered.":[83],"The":[84],"most":[85],"notable":[86],"result":[87],"that":[89],"solution":[93],"can":[94],"be":[95],"updated":[96],"$O(n)$":[98],"new":[101],"node":[102],"added":[104],"an":[106],"n-node":[107],"whose":[109],"known.":[114]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-26T07:53:14.480251","created_date":"2025-10-10T00:00:00"}