{"id":"https://openalex.org/W2268320119","doi":null,"title":"Efficient algorithms for path problems in weighted graphs","display_name":"Efficient algorithms for path problems in weighted graphs","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2268320119","mag":"2268320119"},"language":"en","primary_location":{"id":"mag:2268320119","doi":null,"is_oa":false,"landing_page_url":"http://reports-archive.adm.cs.cmu.edu/anon/2008/CMU-CS-08-147.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","is_traditional":true,"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/A5033930662","display_name":"Guy E. Blelloch","orcid":"https://orcid.org/0000-0003-0224-9187","observed_orcids":["https://orcid.org/0000-0003-0224-9187"]},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guy E. Blelloch","raw_affiliation_strings":["Carnegie Mellon University"],"raw_orcid":"https://orcid.org/0000-0003-0224-9187","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044244682","display_name":"Virginia Vassilevska Williams","orcid":"https://orcid.org/0000-0003-4844-2863","observed_orcids":["https://orcid.org/0000-0003-4844-2863"]},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Virginia Vassilevska","raw_affiliation_strings":["Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":2.0729,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.85066743,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":97},"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":1.0,"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":1.0,"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":9.999999747378752e-05,"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/T11269","display_name":"Algorithms and Data Compression","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.6890000104904175},{"id":"https://openalex.org/keywords/all-pairs-shortest-paths","display_name":"all-pairs shortest paths","score":0.8920000195503235},{"id":"https://openalex.org/keywords/subcubic-algorithms","display_name":"subcubic algorithms","score":0.7879999876022339},{"id":"https://openalex.org/keywords/fast-matrix-multiplication","display_name":"fast matrix multiplication","score":0.7839999794960022},{"id":"https://openalex.org/keywords/sparse-matrix-vector-multiplication","display_name":"sparse matrix-vector multiplication","score":0.7419999837875366},{"id":"https://openalex.org/keywords/single-source-shortest-path","display_name":"single-source shortest path","score":0.7300000190734863},{"id":"https://openalex.org/keywords/directed-graphs","display_name":"directed graphs","score":0.43799999356269836},{"id":"https://openalex.org/keywords/node-weighted-graphs","display_name":"node-weighted graphs","score":0.6589999794960022},{"id":"https://openalex.org/keywords/edge-weighted-graphs","display_name":"edge-weighted graphs","score":0.9800000190734863}],"concepts":[{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.6265872716903687},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6104178428649902},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.5929870009422302},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5358821749687195},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5051026940345764},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.45764797925949097},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45479893684387207},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.44131767749786377},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4134524166584015},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.369687020778656},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2942773699760437},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2932989299297333},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2268320119","doi":null,"is_oa":false,"landing_page_url":"http://reports-archive.adm.cs.cmu.edu/anon/2008/CMU-CS-08-147.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":92,"referenced_works":["https://openalex.org/W61567537","https://openalex.org/W104109059","https://openalex.org/W221907536","https://openalex.org/W273656381","https://openalex.org/W1559997236","https://openalex.org/W1561337879","https://openalex.org/W1565043606","https://openalex.org/W1582106056","https://openalex.org/W1586334185","https://openalex.org/W1598262541","https://openalex.org/W1655990431","https://openalex.org/W1823654214","https://openalex.org/W1941062520","https://openalex.org/W1964915778","https://openalex.org/W1965216219","https://openalex.org/W1967066104","https://openalex.org/W1967534352","https://openalex.org/W1968182342","https://openalex.org/W1970052762","https://openalex.org/W1971039089","https://openalex.org/W1972332180","https://openalex.org/W1973113631","https://openalex.org/W1977545325","https://openalex.org/W1979740015","https://openalex.org/W1980822582","https://openalex.org/W1982444805","https://openalex.org/W1986208679","https://openalex.org/W1987681136","https://openalex.org/W1988114663","https://openalex.org/W1990051509","https://openalex.org/W1991858502","https://openalex.org/W1996440503","https://openalex.org/W1999545213","https://openalex.org/W2007572995","https://openalex.org/W2022841964","https://openalex.org/W2023724794","https://openalex.org/W2028341270","https://openalex.org/W2032841680","https://openalex.org/W2033190478","https://openalex.org/W2033961328","https://openalex.org/W2035144082","https://openalex.org/W2035476608","https://openalex.org/W2043670592","https://openalex.org/W2047505657","https://openalex.org/W2049153008","https://openalex.org/W2049500052","https://openalex.org/W2051531384","https://openalex.org/W2055245094","https://openalex.org/W2057393374","https://openalex.org/W2058426370","https://openalex.org/W2061513598","https://openalex.org/W2064853349","https://openalex.org/W2066367171","https://openalex.org/W2068115726","https://openalex.org/W2070099460","https://openalex.org/W2081254453","https://openalex.org/W2084224084","https://openalex.org/W2085201606","https://openalex.org/W2085917651","https://openalex.org/W2089311600","https://openalex.org/W2090820749","https://openalex.org/W2093266461","https://openalex.org/W2093825995","https://openalex.org/W2093962232","https://openalex.org/W2097382431","https://openalex.org/W2102199027","https://openalex.org/W2104734478","https://openalex.org/W2107351840","https://openalex.org/W2117946984","https://openalex.org/W2118382442","https://openalex.org/W2125528794","https://openalex.org/W2132642300","https://openalex.org/W2138304862","https://openalex.org/W2140232587","https://openalex.org/W2149342630","https://openalex.org/W2150875823","https://openalex.org/W2152290683","https://openalex.org/W2152545366","https://openalex.org/W2153063335","https://openalex.org/W2160563446","https://openalex.org/W2160612583","https://openalex.org/W2164485560","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2296148711","https://openalex.org/W2330022088","https://openalex.org/W2401610261","https://openalex.org/W2545919726","https://openalex.org/W2584013203","https://openalex.org/W2618199688","https://openalex.org/W3099443264","https://openalex.org/W3138807513"],"related_works":["https://openalex.org/W7100740836","https://openalex.org/W3039326214","https://openalex.org/W1511191949","https://openalex.org/W2941901364","https://openalex.org/W2305118455","https://openalex.org/W7097386849","https://openalex.org/W7096822651","https://openalex.org/W2184732484","https://openalex.org/W1986208679","https://openalex.org/W2288676833"],"abstract_inverted_index":{"Problems":[0],"related":[1,289],"to":[2,105,156,172,198,229,271,276],"computing":[3],"optimal":[4,284,293],"paths":[5,50,163,167,265],"have":[6],"been":[7],"abundant":[8],"in":[9,52,71,115,195,237,304,327],"computer":[10],"science":[11],"since":[12,78],"its":[13],"emergence":[14],"as":[15],"a":[16,20,53,74,186,207,213,305,308,323,328],"field.":[17],"Yet":[18],"for":[19,67,234,246,259,321,335,345],"large":[21],"number":[22],"of":[23,42,87,101,141,291,302,310,356],"such":[24,89],"problems":[25,114,122,144,236],"we":[26,145,168,286,297],"still":[27],"do":[28],"not":[29],"know":[30],"whether":[31],"the":[32,36,46,79,98,138,170,174,254,260,288,300,316,336],"state-of-the-art":[33],"algorithms":[34,153,245,334,340,344],"are":[35,169],"best":[37,61],"possible.":[38],"A":[39],"notable":[40],"example":[41],"this":[43,68,102],"phenomenon":[44],"is":[45,93,104,191],"all":[47],"pairs":[48],"shortest":[49,126],"problem":[51,69,290,301],"directed":[54],"graph":[55,307],"with":[56,218],"real":[57],"edge":[58],"weights.":[59],"The":[60],"algorithm":[62,258,275,320],"(modulo":[63],"small":[64],"polylogarithmic":[65],"improvements)":[66],"runs":[70],"cubic":[72,175],"time,":[73],"running":[75,232],"time":[76,257],"known":[77],"1960s":[80],"(by":[81],"Floyd":[82],"and":[83,97,134,164],"Warshall).":[84],"Our":[85],"grasp":[86],"many":[88],"fundamental":[90],"algorithmic":[91],"questions":[92],"far":[94],"from":[95],"optimal,":[96],"major":[99],"goal":[100],"thesis":[103,242],"bring":[106],"some":[107,247,269],"new":[108],"insights":[109],"into":[110],"efficiently":[111],"solving":[112],"path":[113,121,143,235,250],"graphs.":[116,240],"\r\nWe":[117],"focus":[118,298],"on":[119,201,299],"several":[120],"optimizing":[123],"different":[124],"measures:":[125],"paths,":[127,130,133,285],"maximum":[128,161,311,324,347,352],"bottleneck":[129,162],"minimum":[131,165,263,279],"nondecreasing":[132,166,264,280],"various":[135],"extensions.":[136],"For":[137,160],"all-pairs":[139],"versions":[140],"these":[142],"use":[146],"an":[147,274],"algebraic":[148],"approach.":[149],"We":[150,183,205,252,267,314,331],"obtain":[151,230,253,315],"improved":[152],"using":[154],"reductions":[155],"fast":[157,202],"matrix":[158,203,214],"multiplication.":[159,204],"first":[171,255,317],"break":[173],"barrier,":[176],"obtaining":[177],"truly":[178,318],"subcubic":[179,319],"strongly":[180],"polynomial":[181],"algorithms.":[182],"also":[184,243,332],"consider":[185,287],"nonalgebraic,":[187],"combinatorial":[188,208],"approach,":[189],"which":[190],"considered":[192],"more":[193],"efficient":[194],"practice":[196],"compared":[197],"methods":[199],"based":[200],"present":[206,333],"data":[209],"structure":[210],"that":[211,216],"maintains":[212],"so":[215],"products":[217],"given":[219],"sparse":[220,239],"vectors":[221],"can":[222],"be":[223],"computed":[224],"efficiently.":[225],"This":[226],"allows":[227],"us":[228],"good":[231,343],"times":[233],"unweighted":[238],"\r\nThis":[241],"gives":[244],"single":[248,261],"source":[249,262],"problems.":[251],"linear":[256],"problem.":[266],"give":[268],"extensions":[270],"this,":[272],"including":[273],"find":[277],"cheapest":[278],"paths.":[281],"\r\nBesides":[282],"finding":[283,292,303,322,346],"cycles.":[294],"In":[295],"particular,":[296],"weighted":[306],"triangle":[309,326],"weight":[312,325,348,353],"sum.":[313],"node-weighted":[329],"graph.":[330],"edge-weighted":[337],"case.":[338],"These":[339],"immediately":[341],"imply":[342],"k-cliques,":[349],"or":[350],"arbitrary":[351],"pattern":[354],"subgraphs":[355],"fixed":[357],"size.":[358]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}