{"id":"https://openalex.org/W2049802874","doi":"https://doi.org/10.1007/bf01299142","title":"The one-to-one shortest-path problem: An empirical analysis with the two-tree Dijkstra algorithm","display_name":"The one-to-one shortest-path problem: An empirical analysis with the two-tree Dijkstra algorithm","publication_year":1993,"publication_date":"1993-06-01","ids":{"openalex":"https://openalex.org/W2049802874","doi":"https://doi.org/10.1007/bf01299142","mag":"2049802874"},"language":"en","primary_location":{"id":"doi:10.1007/bf01299142","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01299142","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"Computational Optimization and Applications","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/A5064104809","display_name":"Richard V. Helgason","orcid":null},"institutions":[{"id":"https://openalex.org/I178169726","display_name":"Southern Methodist University","ror":"https://ror.org/042tdr378","country_code":"US","type":"education","lineage":["https://openalex.org/I178169726"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Richard V. Helgason","raw_affiliation_strings":["Department of Computer Science and Engineering, Southern Methodist University, 75275-0122, Dallas, TX",", Department of Computer Science and Engineering, Southern Methodist University, Dallas"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Southern Methodist University, 75275-0122, Dallas, TX","institution_ids":["https://openalex.org/I178169726"]},{"raw_affiliation_string":", Department of Computer Science and Engineering, Southern Methodist University, Dallas","institution_ids":["https://openalex.org/I178169726"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109112660","display_name":"Jeffery L. Kennington","orcid":null},"institutions":[{"id":"https://openalex.org/I178169726","display_name":"Southern Methodist University","ror":"https://ror.org/042tdr378","country_code":"US","type":"education","lineage":["https://openalex.org/I178169726"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeffery L. Kennington","raw_affiliation_strings":["Department of Computer Science and Engineering, Southern Methodist University, 75275-0122, Dallas, TX",", Department of Computer Science and Engineering, Southern Methodist University, Dallas"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Southern Methodist University, 75275-0122, Dallas, TX","institution_ids":["https://openalex.org/I178169726"]},{"raw_affiliation_string":", Department of Computer Science and Engineering, Southern Methodist University, Dallas","institution_ids":["https://openalex.org/I178169726"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083083024","display_name":"Brian Stewart","orcid":"https://orcid.org/0000-0003-4637-7818"},"institutions":[{"id":"https://openalex.org/I17301866","display_name":"University of Alabama","ror":"https://ror.org/03xrrjk67","country_code":"US","type":"education","lineage":["https://openalex.org/I17301866"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"B. Douglas Stewart","raw_affiliation_strings":["Department of Industrial Engineering, University of Alabama, 35406-0288, Tuscaloosa, AL","Department of Industrial Engineering, University of Alabama, Tuscaloosa"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, University of Alabama, 35406-0288, Tuscaloosa, AL","institution_ids":["https://openalex.org/I17301866"]},{"raw_affiliation_string":"Department of Industrial Engineering, University of Alabama, Tuscaloosa","institution_ids":["https://openalex.org/I17301866"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5064104809"],"corresponding_institution_ids":["https://openalex.org/I178169726"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":2.3137,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.87022569,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"2","issue":"1","first_page":"47","last_page":"75"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9939000010490417,"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.9939000010490417,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9868999719619751,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9866999983787537,"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/yens-algorithm","display_name":"Yen's algorithm","score":0.8632889986038208},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.8320513963699341},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.822973370552063},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.7374719977378845},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.6404520273208618},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6197522282600403},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.570158839225769},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5683456063270569},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5628735423088074},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.5587561130523682},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.5466211438179016},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5417711138725281},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4660193920135498},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4542761445045471},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4425099194049835},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.434693306684494},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38063639402389526},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14243876934051514},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13012880086898804}],"concepts":[{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.8632889986038208},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8320513963699341},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.822973370552063},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.7374719977378845},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6404520273208618},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6197522282600403},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.570158839225769},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5683456063270569},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5628735423088074},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.5587561130523682},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.5466211438179016},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5417711138725281},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4660193920135498},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4542761445045471},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4425099194049835},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.434693306684494},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38063639402389526},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14243876934051514},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13012880086898804},{"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.1007/bf01299142","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01299142","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"Computational Optimization and Applications","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":28,"referenced_works":["https://openalex.org/W144112274","https://openalex.org/W1513400187","https://openalex.org/W1583205259","https://openalex.org/W1597203970","https://openalex.org/W1965469937","https://openalex.org/W1969483458","https://openalex.org/W1986602944","https://openalex.org/W2024813706","https://openalex.org/W2036030013","https://openalex.org/W2053913299","https://openalex.org/W2055717497","https://openalex.org/W2058605898","https://openalex.org/W2061159212","https://openalex.org/W2061632451","https://openalex.org/W2063317962","https://openalex.org/W2069323107","https://openalex.org/W2071925433","https://openalex.org/W2085917651","https://openalex.org/W2125690626","https://openalex.org/W2144050074","https://openalex.org/W2155370486","https://openalex.org/W2169528473","https://openalex.org/W2270500761","https://openalex.org/W2340365916","https://openalex.org/W2613173048","https://openalex.org/W2614099084","https://openalex.org/W2800875754","https://openalex.org/W4210546998"],"related_works":["https://openalex.org/W651485002","https://openalex.org/W2100214387","https://openalex.org/W2597144308","https://openalex.org/W2183791707","https://openalex.org/W1617152041","https://openalex.org/W2163460271","https://openalex.org/W3029625820","https://openalex.org/W2300444527","https://openalex.org/W2368259793","https://openalex.org/W2349108540"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}