{"id":"https://openalex.org/W2027580688","doi":"https://doi.org/10.1137/0202004","title":"A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time $O(n^2 \\log ^2 n)$","display_name":"A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time $O(n^2 \\log ^2 n)$","publication_year":1973,"publication_date":"1973-03-01","ids":{"openalex":"https://openalex.org/W2027580688","doi":"https://doi.org/10.1137/0202004","mag":"2027580688"},"language":"en","primary_location":{"id":"doi:10.1137/0202004","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0202004","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":[],"countries":[],"is_corresponding":true,"raw_author_name":"P. M. Spira","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5041813088"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":20.0179,"has_fulltext":false,"cited_by_count":98,"citation_normalized_percentile":{"value":0.99193187,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"2","issue":"1","first_page":"28","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9901000261306763,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9890000224113464,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7541952133178711},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6819880604743958},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6429572105407715},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5841465592384338},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5662537217140198},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5320597290992737},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5116487145423889},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.45986509323120117},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.4385700821876526},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3961334228515625},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.3403436541557312},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32749098539352417},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.2584383487701416}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7541952133178711},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6819880604743958},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6429572105407715},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5841465592384338},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5662537217140198},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5320597290992737},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5116487145423889},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.45986509323120117},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4385700821876526},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3961334228515625},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.3403436541557312},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32749098539352417},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.2584383487701416}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0202004","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0202004","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W193706516","https://openalex.org/W2007572995","https://openalex.org/W2144050074","https://openalex.org/W2169528473"],"related_works":["https://openalex.org/W651485002","https://openalex.org/W2360981904","https://openalex.org/W4293054712","https://openalex.org/W2597144308","https://openalex.org/W2358094779","https://openalex.org/W2375775343","https://openalex.org/W2562562750","https://openalex.org/W2366342492","https://openalex.org/W2368964068","https://openalex.org/W4253588386"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,16],"new":[3],"algorithm":[4,22],"for":[5,54],"finding":[6],"the":[7,32,43],"shortest":[8],"path":[9],"between":[10],"each":[11],"pair":[12],"of":[13,46],"nodes":[14,36],"in":[15,37,42],"directed":[17],"nonnegatively":[18],"weighted":[19],"graph.":[20],"Our":[21],"has":[23,34],"average":[24,48],"running":[25,49],"time":[26],"$O(n^2":[27],"\\log":[28],"^2":[29],"n)$":[30],"where":[31],"graph":[33],"n":[35],"contrast":[38],"to":[39],"previous":[40],"algorithms":[41],"literature,":[44],"all":[45],"whose":[47],"times":[50],"are":[51],"$O(n^3":[52],")$":[53],"this":[55],"problem.":[56]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}