{"id":"https://openalex.org/W2022344632","doi":"https://doi.org/10.1137/0206050","title":"A Note on Spira\u2019s Algorithm for the All-Pairs Shortest-Path Problem","display_name":"A Note on Spira\u2019s Algorithm for the All-Pairs Shortest-Path Problem","publication_year":1977,"publication_date":"1977-12-01","ids":{"openalex":"https://openalex.org/W2022344632","doi":"https://doi.org/10.1137/0206050","mag":"2022344632"},"language":"en","primary_location":{"id":"doi:10.1137/0206050","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0206050","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/A5000976194","display_name":"John S. Carson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"John S. Carson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5112327310","display_name":"Averill M. Law","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Averill M. Law","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.2172,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.92088681,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":"4","first_page":"696","last_page":"699"},"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.9975000023841858,"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.9975000023841858,"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.9958000183105469,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9944000244140625,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7960020899772644},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6581302285194397},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6327035427093506},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.6315745115280151},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6243051290512085},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.5501337051391602},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5428365468978882},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5072402358055115},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4900280237197876},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4387039542198181},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19399386644363403},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.18151867389678955}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7960020899772644},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6581302285194397},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6327035427093506},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.6315745115280151},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6243051290512085},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.5501337051391602},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5428365468978882},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5072402358055115},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4900280237197876},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4387039542198181},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19399386644363403},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.18151867389678955},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0206050","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0206050","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"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/1","display_name":"No poverty","score":0.49000000953674316}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2007572995","https://openalex.org/W2027580688","https://openalex.org/W2061135810","https://openalex.org/W2144050074","https://openalex.org/W2169528473","https://openalex.org/W4240200084"],"related_works":["https://openalex.org/W4293054712","https://openalex.org/W2170980056","https://openalex.org/W2578319993","https://openalex.org/W4223969905","https://openalex.org/W2886722595","https://openalex.org/W2379804627","https://openalex.org/W2363342665","https://openalex.org/W2359532380","https://openalex.org/W2990531685","https://openalex.org/W78690942"],"abstract_inverted_index":{"We":[0],"correct":[1],"some":[2],"errors":[3],"in":[4],"Spira\u2019s":[5,29],"algorithm":[6,16,30],"for":[7,34],"the":[8,42],"all-pairs":[9],"shortest-path":[10],"problem,":[11],"and":[12,47],"empirically":[13],"compare":[14],"his":[15],"(with":[17],"two":[18,51],"distinct":[19],"sorting,":[20],"routines)":[21],"to":[22],"Dijkstra\u2019s":[23],"procedure.":[24],"The":[25],"results":[26],"show":[27],"that":[28,41],"is":[31,39],"only":[32],"efficient":[33],"\u201clarge\u201d":[35],"networks.":[36],"Furthermore,":[37],"it":[38],"seen":[40],"asymptotic":[43],"number":[44],"of":[45,59],"additions":[46],"comparisons":[48],"required":[49],"by":[50],"algorithms":[52],"may":[53],"be":[54],"a":[55],"very":[56],"poor":[57],"indicator":[58],"their":[60],"relative":[61],"running":[62],"times.":[63]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}