{"id":"https://openalex.org/W7128480316","doi":"https://doi.org/10.48550/arxiv.2602.07868","title":"A Faster Directed Single-Source Shortest Path Algorithm","display_name":"A Faster Directed Single-Source Shortest Path Algorithm","publication_year":2026,"publication_date":"2026-02-08","ids":{"openalex":"https://openalex.org/W7128480316","doi":"https://doi.org/10.48550/arxiv.2602.07868"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2602.07868","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.07868","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2602.07868","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5125503418","display_name":"Ran Duan","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Duan, Ran","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063818718","display_name":"Xiao Mao","orcid":"https://orcid.org/0000-0002-1224-9730"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mao, Xiao","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046511417","display_name":"Xinkai Shu","orcid":"https://orcid.org/0000-0002-5481-6553"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shu, Xinkai","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5108276380","display_name":"Longhui Yin","orcid":"https://orcid.org/0000-0001-5696-5678"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yin, Longhui","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5125503418"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"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.8263999819755554,"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.8263999819755554,"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/T11106","display_name":"Data Management and Algorithms","score":0.05660000070929527,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.024700000882148743,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.6340000033378601},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5286999940872192},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.506600022315979},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4666000008583069},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4505999982357025},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.41600000858306885},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.39739999175071716},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.38679999113082886}],"concepts":[{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.6340000033378601},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5892000198364258},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5493999719619751},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5286999940872192},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.506600022315979},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4666000008583069},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4505999982357025},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.41600000858306885},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.39739999175071716},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.38679999113082886},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3785000145435333},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32580000162124634},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.32019999623298645},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2906999886035919},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.2816999852657318},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2809999883174896},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.28029999136924744},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.2777999937534332},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.27219998836517334},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26440000534057617},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2639999985694885},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.25769999623298645},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.25029999017715454}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2602.07868","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.07868","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2602.07868","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.07868","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0,35],"paper":[1],"presents":[2],"a":[3],"new":[4],"deterministic":[5],"algorithm":[6,48],"for":[7,32,45],"single-source":[8],"shortest":[9],"paths":[10],"(SSSP)":[11],"on":[12],"real":[13],"non-negative":[14],"edge-weighted":[15],"directed":[16,46],"graphs,":[17],"with":[18],"running":[19],"time":[20,44],"$O(m\\sqrt{\\log":[21,28],"n}+\\sqrt{mn\\log":[22],"n\\log":[23,29],"\\log":[24,30],"n})$,":[25],"which":[26],"is":[27],"n})$":[31],"sparse":[33],"graphs.":[34],"improves":[36],"the":[37],"recent":[38],"breakthrough":[39],"result":[40],"of":[41],"$O(m\\log^{2/3}":[42],"n)$":[43],"SSSP":[47],"[Duan,":[49],"Mao,":[50,51],"Shu,":[52],"Yin":[53],"2025].":[54]},"counts_by_year":[],"updated_date":"2026-02-11T14:45:31.134243","created_date":"2026-02-11T00:00:00"}