{"id":"https://openalex.org/W2570528627","doi":"https://doi.org/10.1137/140970975","title":"A Forward-Backward Single-Source Shortest Paths Algorithm","display_name":"A Forward-Backward Single-Source Shortest Paths Algorithm","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2570528627","doi":"https://doi.org/10.1137/140970975","mag":"2570528627"},"language":"en","primary_location":{"id":"doi:10.1137/140970975","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140970975","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/A5107232988","display_name":"David B. Wilson","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"David B. Wilson","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5005525211","display_name":"Uri Zwick","orcid":"https://orcid.org/0000-0002-7638-7710"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Uri Zwick","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5107232988"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23223936,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"44","issue":"3","first_page":"698","last_page":"739"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9983999729156494,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.996999979019165,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7146766185760498},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.7081347107887268},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5673676133155823},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5619964599609375},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5445606112480164},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.5269421339035034},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5222002863883972},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.515038013458252},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4858088493347168},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.4639173746109009},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4168604016304016},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4024501442909241},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3963095545768738},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.37464749813079834}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7146766185760498},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.7081347107887268},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5673676133155823},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5619964599609375},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5445606112480164},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.5269421339035034},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5222002863883972},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.515038013458252},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4858088493347168},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4639173746109009},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4168604016304016},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4024501442909241},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3963095545768738},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.37464749813079834},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/140970975","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140970975","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1965469937","https://openalex.org/W1969573308","https://openalex.org/W1978757752","https://openalex.org/W1982440947","https://openalex.org/W1991778515","https://openalex.org/W1993643838","https://openalex.org/W1996641400","https://openalex.org/W1999545213","https://openalex.org/W2007687856","https://openalex.org/W2027580688","https://openalex.org/W2030917606","https://openalex.org/W2031541804","https://openalex.org/W2033646167","https://openalex.org/W2038504986","https://openalex.org/W2051213257","https://openalex.org/W2054523876","https://openalex.org/W2056062768","https://openalex.org/W2058605898","https://openalex.org/W2059014957","https://openalex.org/W2074567977","https://openalex.org/W2084224084","https://openalex.org/W2084623271","https://openalex.org/W2118169763","https://openalex.org/W2130956934","https://openalex.org/W2160365857","https://openalex.org/W2169528473","https://openalex.org/W2172287576","https://openalex.org/W2624301084"],"related_works":["https://openalex.org/W2136320479","https://openalex.org/W2372677512","https://openalex.org/W2387829241","https://openalex.org/W2810620529","https://openalex.org/W2381419702","https://openalex.org/W2147862592","https://openalex.org/W2004871029","https://openalex.org/W4253588386","https://openalex.org/W1508906807","https://openalex.org/W2371042914"],"abstract_inverted_index":{"We":[0],"describe":[1],"a":[2,78,127,132,156],"new":[3,25,32,133,179],"forward-backward":[4,123],"variant":[5],"of":[6,44,51,74,103,142,159],"Dijkstra's":[7],"and":[8,40,122,161],"Spira's":[9],"single-source":[10],"shortest":[11,135],"paths":[12,136],"(SSSP)":[13],"algorithms.":[14,125],"While":[15],"essentially":[16],"all":[17],"SSSP":[18,124],"algorithms":[19],"scan":[20],"edges":[21,29,36],"only":[22,111],"forward,":[23],"the":[24,38,45,56,60,75,99,143,175,178,191],"algorithm":[26,33,54,76,144,158,180],"scans":[27,113],"some":[28],"backward.":[30],"The":[31,71,138],"assumes":[34],"that":[35,177],"in":[37,48],"outgoing":[39,61],"incoming":[41,68],"adjacency":[42,62,69],"lists":[43,63],"vertices":[46,84],"appear":[47],"nondecreasing":[49],"order":[50],"weight.":[52],"(Spira's":[53],"makes":[55],"same":[57],"assumption":[58],"about":[59],"but":[64],"does":[65],"not":[66],"use":[67],"lists.)":[70],"running":[72,140],"time":[73,141,185],"on":[77,82,98,145,190],"complete":[79,146],"directed":[80],"graph":[81],"$n$":[83],"with":[85,92,148],"independent":[86,149],"exponential":[87,150],"edge":[88,151],"weights":[89,152],"is":[90,107,153,186],"$O(n)$":[91],"very":[93],"high":[94],"probability.":[95],"This":[96],"improves":[97],"previous":[100],"best":[101,108],"result":[102],"$O(n\\log":[104],"n)$,":[105],"which":[106],"possible":[109],"if":[110],"forward":[112],"are":[114],"allowed,":[115],"exhibiting":[116],"an":[117],"interesting":[118],"separation":[119],"between":[120],"forward-only":[121],"As":[126],"consequence,":[128],"we":[129],"also":[130],"get":[131],"all-pairs":[134],"algorithm.":[137],"expected":[139],"graphs":[147],"$O(n^2)$,":[154],"matching":[155],"recent":[157],"Demetrescu":[160],"Italiano":[162],"as":[163],"analyzed":[164],"by":[165,196],"Peres":[166,197],"et":[167,198],"al.":[168,199],"[J.":[169],"ACM,":[170],"60":[171],"(2013),":[172],"26].":[173],"Furthermore,":[174],"probability":[176,193],"requires":[181],"more":[182],"than":[183],"$O(n^2)$":[184],"exponentially":[187],"small,":[188],"improving":[189],"$O(n^{-1/26})$":[192],"bound":[194],"obtained":[195]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}