{"id":"https://openalex.org/W2065105907","doi":"https://doi.org/10.1137/s0097539702419650","title":"A Shortest Path Algorithm for Real-Weighted Undirected Graphs","display_name":"A Shortest Path Algorithm for Real-Weighted Undirected Graphs","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2065105907","doi":"https://doi.org/10.1137/s0097539702419650","mag":"2065105907"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539702419650","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539702419650","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/A5076564426","display_name":"Seth Pettie","orcid":"https://orcid.org/0000-0002-0495-3904"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Seth Pettie","raw_affiliation_strings":["[Max-Planck Institute for Informatics]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[Max-Planck Institute for Informatics]","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101698836","display_name":"Vijaya Ramachandran","orcid":"https://orcid.org/0000-0001-7561-5235"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vijaya Ramachandran","raw_affiliation_strings":["University of Texas at Austin#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Texas at Austin#TAB#","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.6537,"has_fulltext":false,"cited_by_count":101,"citation_normalized_percentile":{"value":0.96650858,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"34","issue":"6","first_page":"1398","last_page":"1431"},"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.9998999834060669,"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.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/ackermann-function","display_name":"Ackermann function","score":0.7315585613250732},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6859784126281738},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.632343590259552},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5963302850723267},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5216034650802612},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5113376975059509},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.48803582787513733},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.47085779905319214},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.46626290678977966},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45987457036972046},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4586697816848755},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4446316659450531},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4100686013698578},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.40385153889656067},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.18115946650505066}],"concepts":[{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.7315585613250732},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6859784126281738},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.632343590259552},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5963302850723267},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5216034650802612},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5113376975059509},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.48803582787513733},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.47085779905319214},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.46626290678977966},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45987457036972046},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4586697816848755},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4446316659450531},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4100686013698578},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.40385153889656067},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.18115946650505066},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0097539702419650","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539702419650","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.100.2138","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.2138","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.umich.edu/~pettie/papers/undsp.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.14.570","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.570","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utexas.edu/users/seth/papers/undirected-sp.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.590.7321","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.590.7321","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utexas.edu/~vlr/papers/sicomp05.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":63,"referenced_works":["https://openalex.org/W1480135873","https://openalex.org/W1498660721","https://openalex.org/W1521472129","https://openalex.org/W1537256577","https://openalex.org/W1556485156","https://openalex.org/W1559701472","https://openalex.org/W1567047166","https://openalex.org/W1598589216","https://openalex.org/W1602103078","https://openalex.org/W1624237777","https://openalex.org/W1823654214","https://openalex.org/W1964948588","https://openalex.org/W1965525854","https://openalex.org/W1969357318","https://openalex.org/W1969573308","https://openalex.org/W1969668378","https://openalex.org/W1977545325","https://openalex.org/W1979867994","https://openalex.org/W1986261983","https://openalex.org/W1990678352","https://openalex.org/W1999545213","https://openalex.org/W2003969379","https://openalex.org/W2004116976","https://openalex.org/W2006570180","https://openalex.org/W2022980325","https://openalex.org/W2023658462","https://openalex.org/W2027580688","https://openalex.org/W2028341270","https://openalex.org/W2029132631","https://openalex.org/W2032841680","https://openalex.org/W2047976119","https://openalex.org/W2048500523","https://openalex.org/W2048824634","https://openalex.org/W2049500052","https://openalex.org/W2054523876","https://openalex.org/W2056496054","https://openalex.org/W2058426370","https://openalex.org/W2059014957","https://openalex.org/W2060919812","https://openalex.org/W2065759448","https://openalex.org/W2071845176","https://openalex.org/W2072064573","https://openalex.org/W2074286662","https://openalex.org/W2084224084","https://openalex.org/W2091299439","https://openalex.org/W2099463627","https://openalex.org/W2103361121","https://openalex.org/W2105310556","https://openalex.org/W2124852572","https://openalex.org/W2133768189","https://openalex.org/W2138304862","https://openalex.org/W2139559590","https://openalex.org/W2148329647","https://openalex.org/W2151021662","https://openalex.org/W2156153879","https://openalex.org/W2160365857","https://openalex.org/W2160495255","https://openalex.org/W2164141517","https://openalex.org/W2169528473","https://openalex.org/W2618199688","https://openalex.org/W2762935521","https://openalex.org/W3145128584","https://openalex.org/W4251364725"],"related_works":["https://openalex.org/W2810620529","https://openalex.org/W4253588386","https://openalex.org/W2136320479","https://openalex.org/W1562631103","https://openalex.org/W2381419702","https://openalex.org/W1508906807","https://openalex.org/W2170980056","https://openalex.org/W2348177054","https://openalex.org/W2372677512","https://openalex.org/W2147862592"],"abstract_inverted_index":{"We":[0,79],"present":[1],"a":[2,26],"new":[3,68],"scheme":[4],"for":[5,134],"computing":[6],"shortest":[7,32,76],"paths":[8,77],"on":[9,70],"real-weighted":[10],"undirected":[11,137],"graphs":[12],"in":[13,35,84,112],"the":[14,45,52,58,72,81,91,94,109,131,142],"fundamental":[15],"comparison-addition":[16],"model.":[17],"In":[18],"an":[19],"efficient":[20],"preprocessing":[21],"phase":[22],"our":[23,65],"algorithm":[24,66,140],"creates":[25],"linear-size":[27],"structure":[28],"that":[29],"facilitates":[30],"single-source":[31,75,110],"path":[33],"computations":[34],"O(m":[36,113],"log":[37,86,116,117],"$\\alpha$)":[38],"time,":[39],"where":[40],"$\\alpha$":[41],"=":[42],"$\\alpha$(m,n)":[43],"is":[44,100],"very":[46],"slowly":[47],"growing":[48],"inverse-Ackermann":[49],"function,":[50],"m":[51],"number":[53,59],"of":[54,60],"edges,":[55],"and":[56,74,96],"n":[57,115],"vertices.":[61],"As":[62],"special":[63],"cases":[64],"implies":[67],"bounds":[69],"both":[71],"all-pairs":[73,82],"problems.":[78],"solve":[80,108],"problem":[83,111],"O(mn":[85],"$\\alpha$(m,n))":[87],"time":[88],"and,":[89],"if":[90],"ratio":[92],"between":[93],"maximum":[95],"minimum":[97],"edge":[98],"lengths":[99],"bounded":[101],"by":[102,146],"n(log":[103],"n)O(1)":[104],",":[105],"we":[106],"can":[107],"+":[114],"n)":[118],"time.":[119],"Both":[120],"these":[121],"results":[122],"are":[123],"theoretical":[124],"improvements":[125],"over":[126],"Dijkstra's":[127],"algorithm,":[128],"which":[129],"was":[130],"previous":[132],"best":[133],"real":[135],"weighted":[136],"graphs.":[138],"Our":[139],"takes":[141],"hierarchy-based":[143],"approach":[144],"invented":[145],"Thorup.":[147]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":8}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}