{"id":"https://openalex.org/W2051531384","doi":"https://doi.org/10.1145/1250790.1250876","title":"All-pairs bottleneck paths for general graphs in truly sub-cubic time","display_name":"All-pairs bottleneck paths for general graphs in truly sub-cubic time","publication_year":2007,"publication_date":"2007-06-11","ids":{"openalex":"https://openalex.org/W2051531384","doi":"https://doi.org/10.1145/1250790.1250876","mag":"2051531384"},"language":"en","primary_location":{"id":"doi:10.1145/1250790.1250876","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1250790.1250876","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-ninth annual ACM symposium on Theory of computing","raw_type":"proceedings-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/A5064187228","display_name":"Virginia Vassilevska","orcid":null},"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":true,"raw_author_name":"Virginia Vassilevska","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA","Carnegie-Mellon University, Pittsburgh, PA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063871533","display_name":"Ryan Williams","orcid":"https://orcid.org/0000-0003-2326-2233"},"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":"Ryan Williams","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA","Carnegie-Mellon University, Pittsburgh, PA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026016357","display_name":"Raphael Yuster","orcid":"https://orcid.org/0000-0001-7550-6506"},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Raphael Yuster","raw_affiliation_strings":["University of Haifa, Haifa, Israel",", University of Haifa, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"University of Haifa, Haifa, Israel","institution_ids":["https://openalex.org/I91203450"]},{"raw_affiliation_string":", University of Haifa, Haifa, Israel","institution_ids":["https://openalex.org/I91203450"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5064187228"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":5.6035,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.96000963,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"585","last_page":"589"},"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.9988999962806702,"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.9988999962806702,"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/T12288","display_name":"Optimization and Search Problems","score":0.9979000091552734,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9764999747276306,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.8981605768203735},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.6536362171173096},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.606564462184906},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4793413579463959},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4687659442424774},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46275943517684937},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4575175344944},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44946154952049255},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4441741406917572},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44193005561828613},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.2117551863193512},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09245404601097107}],"concepts":[{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.8981605768203735},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6536362171173096},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.606564462184906},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4793413579463959},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4687659442424774},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46275943517684937},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4575175344944},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44946154952049255},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4441741406917572},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44193005561828613},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.2117551863193512},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09245404601097107},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1250790.1250876","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1250790.1250876","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-ninth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.131.5606","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.131.5606","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~ryanw/apbp-stoc2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.164.9808","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.9808","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dme.gov.za/pdfs/energy/renewable/note%20on%20statutory%20requirements%20for%20retrenchment%20_3_.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.96.8492","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.96.8492","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.haifa.ac.il/~raphy/papers/apbp.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1823654214","https://openalex.org/W1941062520","https://openalex.org/W1970052762","https://openalex.org/W1971039089","https://openalex.org/W1979740015","https://openalex.org/W1982444805","https://openalex.org/W1986208679","https://openalex.org/W2043670592","https://openalex.org/W2049153008","https://openalex.org/W2049500052","https://openalex.org/W2057393374","https://openalex.org/W2058426370","https://openalex.org/W2084224084","https://openalex.org/W2097382431","https://openalex.org/W2114365471","https://openalex.org/W2133228819","https://openalex.org/W2133768189","https://openalex.org/W2152290683","https://openalex.org/W2154848433","https://openalex.org/W2161863751","https://openalex.org/W2330022088","https://openalex.org/W3163397523","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1519427079","https://openalex.org/W2354846196","https://openalex.org/W4382994290","https://openalex.org/W2348761196","https://openalex.org/W2391130892","https://openalex.org/W4361010448","https://openalex.org/W3121758909","https://openalex.org/W2392078542","https://openalex.org/W2184939461","https://openalex.org/W200172885"],"abstract_inverted_index":{"In":[0,91],"the":[1,38,69,80,99,120,127,154,157],"all-pairs":[2,75],"bottleneck":[3,140],"paths":[4],"(APBP)":[5],"problem":[6,60],"(a.k.a.":[7],"allpairs":[8],"maximum":[9,47,72,139],"capacity":[10,39],"paths),":[11],"one":[12],"is":[13,26,119,126],"given":[14],"a":[15,41,46,95],"directed":[16],"graph":[17],"with":[18],"real":[19],"non-negative":[20],"capacities":[21],"on":[22],"its":[23],"edges":[24],"and":[25,36,74,124],"asked":[27],"to":[28,56],"determine,":[29],"for":[30,44,85,97,129,142],"all":[31],"pairs":[32],"of":[33,40,49,71,101,122,145,156],"vertices":[34,123],"s":[35,55],"t,":[37],"single":[42],"path":[43,141],"which":[45],"amount":[48],"flow":[50],"can":[51,147],"be":[52,148],"routed":[53],"from":[54],"t.":[57],"The":[58],"APBP":[59,86],"was":[61],"first":[62,81],"studied":[63],"in":[64,87,110,150,153],"operations":[65],"research,":[66],"shortly":[67],"after":[68],"introduction":[70],"flows":[73],"shortest":[76],"paths.":[77],"We":[78],"present":[79],"truly":[82],"sub-cubic":[83],"algorithm":[84],"general":[88],"dense":[89],"graphs.":[90],"particular,":[92],"we":[93],"give":[94],"procedure":[96],"computing":[98],"(max,min)-product":[100],"two":[102],"arbitrary":[103],"matrices":[104],"over":[105,132],"R":[106],"\u222a":[107],"{\u221e,":[108],"\u2212\u221e}":[109],"O(n":[111,114],"2+\u03c9/3)":[112],"\u2264":[113],"2.792)":[115],"time,":[116],"where":[117],"n":[118],"number":[121],"\u03c9":[125],"exponent":[128],"matrix":[130],"multiplication":[131],"rings.":[133],"Using":[134],"this":[135],"procedure,":[136],"an":[137],"explicit":[138],"any":[143],"pair":[144],"nodes":[146],"extracted":[149],"time":[151],"linear":[152],"length":[155],"path.":[158]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}