{"id":"https://openalex.org/W75321019","doi":null,"title":"Dijkstra's Shortest Path Algorithm","display_name":"Dijkstra's Shortest Path Algorithm","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W75321019","mag":"75321019"},"language":"es","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.75.1806","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.75.1806","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://mizar.org/JFM/ps/graphsp.ps","raw_type":"text"},"volume":null,"type":"article","indexed_in":[],"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/A5003760095","display_name":"Jingchao Chen","orcid":"https://orcid.org/0000-0003-4718-4946","observed_orcids":["https://orcid.org/0000-0003-4718-4946"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jingchao Chen","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-4718-4946","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5003760095"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4521,"has_fulltext":false,"cited_by_count":79,"citation_normalized_percentile":{"value":0.79765496,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9984999895095825,"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.9984999895095825,"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.0013000000035390258,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":9.999999747378752e-05,"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/dijkstra-s-algorithm","display_name":"Dijkstra's algorithm","score":0.9800000190734863},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.8500000238418579},{"id":"https://openalex.org/keywords/non-negative-edge-weights","display_name":"non-negative edge weights","score":0.7720000147819519},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":0.7099999785423279},{"id":"https://openalex.org/keywords/formalization","display_name":"formalization","score":0.6230000257492065},{"id":"https://openalex.org/keywords/single-source-shortest-path","display_name":"single-source shortest path","score":0.4729999899864197}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.784104585647583},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.662025511264801},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5800830721855164},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.543432891368866},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4948093295097351},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.483503133058548},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46257641911506653},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44721391797065735},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3788885474205017},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3323419392108917},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21446317434310913},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06564542651176453}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.75.1806","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.75.1806","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://mizar.org/JFM/ps/graphsp.ps","raw_type":"text"},{"id":"mag:75321019","doi":null,"is_oa":false,"landing_page_url":"http://fm.mizar.org/2003-11/pdf11-3/graphsp.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W22141270","https://openalex.org/W141803834","https://openalex.org/W148282774","https://openalex.org/W180239714","https://openalex.org/W260340778","https://openalex.org/W1483101703","https://openalex.org/W1619732349","https://openalex.org/W2105559527","https://openalex.org/W2118242375","https://openalex.org/W2119808799","https://openalex.org/W2150348213","https://openalex.org/W2169528473"],"related_works":["https://openalex.org/W2348287729","https://openalex.org/W2387829241","https://openalex.org/W2169528473","https://openalex.org/W2375333907","https://openalex.org/W2383983084","https://openalex.org/W2383519316","https://openalex.org/W2363698354","https://openalex.org/W2369413888","https://openalex.org/W2348031504","https://openalex.org/W2348117608","https://openalex.org/W2348177054","https://openalex.org/W2363342665","https://openalex.org/W2369293211","https://openalex.org/W2349108540","https://openalex.org/W2370124044","https://openalex.org/W2376387406","https://openalex.org/W2383241910","https://openalex.org/W2366030902","https://openalex.org/W2379352824","https://openalex.org/W2393741605"],"abstract_inverted_index":{"Summary.":[0],"The":[1,53,60,74],"article":[2],"formalizes":[3],"Dijkstra\u2019s":[4,38,196],"shortest":[5,26,151],"path":[6,10,27,152,188],"algorithm":[7,39,79,86,197],"[11].":[8],"A":[9],"from":[11,116,153,189],"a":[12,17,63,102,123,187],"source":[13,61,118,155,191],"vertex":[14,19,130,203],"v":[15],"to":[16,23,127,156,192,218],"target":[18,68],"u":[20,157],"is":[21,32,40,57,62,141,146,210],"said":[22],"be":[24,70,81],"the":[25,43,67,78,85,89,93,112,117,133,135,147,150,154,159,168,181,190,202,214,219],"if":[28],"its":[29],"total":[30],"cost":[31,115,125,148,207],"minimum":[33,205],"among":[34],"all":[35,71,138,171],"v-to-u":[36],"paths.":[37],"based":[41],"on":[42],"following":[44],"assumptions:":[45],"\u2022":[46,52,59],"All":[47],"edge":[48],"costs":[49],"are":[50,176],"non-negative.":[51],"number":[54],"of":[55,77,97,105,137,149,170,184],"vertices":[56,94,107,140,173],"finite.":[58],"single":[64],"vertex,":[65],"but":[66],"may":[69,80],"other":[72],"vertices.":[73],"underlying":[75],"principle":[76],"described":[82],"as":[83],"follows:":[84],"starts":[87],"with":[88,204],"source;":[90],"it":[91,217],"visits":[92],"in":[95,111,158,180,213],"order":[96],"increasing":[98],"cost,":[99],"and":[100,122,222],"maintains":[101],"set":[103,136,169,220],"V":[104,163,221],"visited":[106],"(denoted":[108],"by":[109,143,162,194],"UsedVx":[110],"article)":[113],"whose":[114,174],"has":[119,186],"been":[120],"computed,":[121],"tentative":[124,206],"D(u)":[126,145],"each":[128,183],"unvisited":[129,139,172],"u.":[131],"In":[132],"article,":[134],"denoted":[142],"UnusedVx.":[144],"subgraph":[160,182],"induced":[161],"\u222a":[164],"{u}.":[165],"We":[166],"denote":[167],"Dvalues":[175],"not":[177],"infinite":[178],"(i.e.":[179],"which":[185],"itself)":[193],"OuterVx.":[195],"repeatedly":[198],"searches":[199],"OuterVx":[200],"for":[201],"(this":[208],"procedure":[209],"called":[211],"findmin":[212],"article),":[215],"adds":[216],"modifies":[223]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2025-10-10T00:00:00"}