{"id":"https://openalex.org/W2906869740","doi":"https://doi.org/10.48550/arxiv.1812.10499","title":"Removing Sequential Bottleneck of Dijkstra's Algorithm for the Shortest Path Problem","display_name":"Removing Sequential Bottleneck of Dijkstra's Algorithm for the Shortest Path Problem","publication_year":2018,"publication_date":"2018-12-26","ids":{"openalex":"https://openalex.org/W2906869740","doi":"https://doi.org/10.48550/arxiv.1812.10499","mag":"2906869740"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:1812.10499","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1812.10499","pdf_url":"https://arxiv.org/pdf/1812.10499","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1812.10499","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061474994","display_name":"Vijay K. Garg","orcid":"https://orcid.org/0000-0002-5797-4389","observed_orcids":["https://orcid.org/0000-0002-5797-4389"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Garg, Vijay K.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5061474994"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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.9771000146865845,"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.9771000146865845,"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.021800000220537186,"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":0.0003000000142492354,"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.9169999957084656},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.9670000076293945},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.8379999995231628},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"upper and lower bounds","score":0.7160000205039978},{"id":"https://openalex.org/keywords/edge-relaxation","display_name":"edge relaxation","score":0.7369999885559082},{"id":"https://openalex.org/keywords/directed-acyclic-graphs","display_name":"directed acyclic graphs","score":0.9660000205039978},{"id":"https://openalex.org/keywords/job-complexity","display_name":"job complexity","score":0.8320000171661377},{"id":"https://openalex.org/keywords/parallelism","display_name":"parallelism","score":0.4189999997615814}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8474421501159668},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.6912854909896851},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5686200261116028},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5321397185325623},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5207647681236267},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5031582713127136},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.42284858226776123},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.41763001680374146},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4112374186515808},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40911173820495605},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39282214641571045},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36914873123168945},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3413429856300354}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:1812.10499","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1812.10499","pdf_url":"https://arxiv.org/pdf/1812.10499","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.1812.10499","doi":"https://doi.org/10.48550/arxiv.1812.10499","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1812.10499","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1812.10499","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1812.10499","pdf_url":"https://arxiv.org/pdf/1812.10499","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1521472129","https://openalex.org/W1969483458","https://openalex.org/W2007572995","https://openalex.org/W2057112598","https://openalex.org/W2083669067","https://openalex.org/W2089026470","https://openalex.org/W2150898004","https://openalex.org/W2160365857","https://openalex.org/W2169528473","https://openalex.org/W2227557434"],"related_works":["https://openalex.org/W3205035283","https://openalex.org/W2381419702","https://openalex.org/W4281943708","https://openalex.org/W1562631103","https://openalex.org/W2810620529","https://openalex.org/W1508906807","https://openalex.org/W4253588386","https://openalex.org/W3015233512","https://openalex.org/W3155894620","https://openalex.org/W2367161887"],"abstract_inverted_index":{"All":[0],"traditional":[1],"methods":[2],"of":[3,13,89,108,115,125,137,177,185],"computing":[4],"shortest":[5],"paths":[6],"depend":[7],"upon":[8],"edge-relaxation":[9],"where":[10,110,172],"the":[11,52,64,87,105,113,118,175,182,191,201],"cost":[12,54],"reaching":[14,43],"a":[15,18,31,44,141,186],"vertex":[16,20],"from":[17],"source":[19],"is":[21,27,112,121,174,181],"possibly":[22],"decreased":[23],"if":[24],"that":[25,124,136],"edge":[26],"used.":[28],"We":[29,70],"introduce":[30],"method":[32,47],"which":[33,120],"maintains":[34],"lower":[35],"bounds":[36,41],"as":[37,39],"well":[38],"upper":[40],"for":[42,55,140,146,154],"vertex.":[45],"This":[46],"enables":[48],"one":[49,59],"to":[50],"find":[51],"optimal":[53,106],"multiple":[56],"vertices":[57,178],"in":[58,67,74,92,117],"iteration":[60],"and":[61,81,84,151,179,207],"thereby":[62],"reduces":[63],"sequential":[65,142],"bottleneck":[66],"Dijkstra's":[68,93,126,138,211],"algorithm.":[69,94,127,212],"present":[71],"four":[72],"algorithms":[73,199],"this":[75],"paper":[76],"---":[77],"$SP_1$,":[78],"$SP_2$,":[79],"$SP_3$":[80,150,164],"$SP_4$.":[82],"$SP_1$":[83],"$SP_2$":[85],"reduce":[86],"number":[88,114,176],"heap":[90],"operations":[91],"For":[95,128],"directed":[96,100],"acyclic":[97],"graphs,":[98,130],"or":[99],"unweighted":[101],"graphs":[102],"they":[103],"have":[104],"complexity":[107,134],"$O(e)$":[109],"$e$":[111],"edges":[116],"graph":[119],"better":[122],"than":[123],"general":[129],"their":[131],"worst":[132],"case":[133],"matches":[135],"algorithm":[139],"implementation":[143],"but":[144,158],"allows":[145],"greater":[147],"parallelism.":[148,193],"Algorithms":[149],"$SP_4$":[152,189],"allow":[153],"even":[155],"more":[156],"parallelism":[157],"with":[159],"higher":[160],"work":[161,171,202],"complexity.":[162],"Algorithm":[163,188],"requires":[165,195],"$O(n":[166],"+":[167],"e(\\max(\\log":[168],"n,":[169],"\u0394)))$":[170],"$n$":[173],"$\u0394$":[180],"maximum":[183],"in-degree":[184],"node.":[187],"has":[190],"most":[192],"It":[194],"$O(ne)$":[196],"work.":[197],"These":[198],"generalize":[200],"by":[203],"Crauser,":[204],"Mehlhorn,":[205],"Meyer,":[206],"Sanders":[208],"on":[209],"parallelizing":[210]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2019-01-11T00:00:00"}