{"id":"https://openalex.org/W1986208679","doi":"https://doi.org/10.5555/1283383.1283488","title":"All-pairs bottleneck paths in vertex weighted graphs","display_name":"All-pairs bottleneck paths in vertex weighted graphs","alternate_titles":[],"publication_year":2007,"publication_date":"2007-01-07","ids":{"openalex":"https://openalex.org/W1986208679","doi":"https://doi.org/10.5555/1283383.1283488","mag":"1986208679"},"language":"en","primary_location":{"id":"mag:1986208679","doi":"https://doi.org/10.5555/1283383.1283488","is_oa":false,"landing_page_url":"http://research.haifa.ac.il/~raphy/papers/bottle.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W1986208679"],"child_works_count":0,"type":"conference-paper","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":null,"display_name":"A. Shapira","orcid":"https://orcid.org/0000-0001-9902-0164","observed_orcids":["https://orcid.org/0000-0001-9902-0164"]},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Shapira","raw_affiliation_strings":["Microsoft research#TAB#"],"raw_orcid":"https://orcid.org/0000-0001-9902-0164","affiliations":[{"raw_affiliation_string":"Microsoft research#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026016357","display_name":"Raphael Yuster","orcid":"https://orcid.org/0000-0001-7550-6506","observed_orcids":["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"],"raw_orcid":"https://orcid.org/0000-0001-7550-6506","affiliations":[{"raw_affiliation_string":", University of Haifa, Haifa, Israel","institution_ids":["https://openalex.org/I91203450"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005525211","display_name":"Uri Zwick","orcid":"https://orcid.org/0000-0002-7638-7710","observed_orcids":["https://orcid.org/0000-0002-7638-7710"]},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Uri Zwick","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel,"],"raw_orcid":"https://orcid.org/0000-0002-7638-7710","affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7995,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.90985249,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"978","last_page":"985"},"is_retracted":false,"is_pulled":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/vertex-weighted-graphs","display_name":"vertex-weighted graphs","score":0.824999988079071},{"id":"https://openalex.org/keywords/directed-graphs","display_name":"directed graphs","score":0.8529999852180481},{"id":"https://openalex.org/keywords/fast-matrix-multiplication","display_name":"fast matrix multiplication","score":0.8930000066757202},{"id":"https://openalex.org/keywords/all-pairs-shortest-paths","display_name":"all-pairs shortest paths","score":0.6629999876022339},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":0.41999998688697815}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7705947756767273},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.7035639882087708},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6266673803329468},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.5763901472091675},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5517388582229614},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.5201902389526367},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4883098602294922},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4663293659687042},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4635898768901825},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3579876124858856},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1747838258743286},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"mag:1986208679","doi":"https://doi.org/10.5555/1283383.1283488","is_oa":false,"landing_page_url":"http://research.haifa.ac.il/~raphy/papers/bottle.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.78.4011","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.78.4011","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.tau.ac.il/~asafico/bottle.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.96.4491","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.96.4491","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/bottle.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W221907536","https://openalex.org/W1511191949","https://openalex.org/W1655990431","https://openalex.org/W1941062520","https://openalex.org/W1963838724","https://openalex.org/W1965216219","https://openalex.org/W1979740015","https://openalex.org/W1987719024","https://openalex.org/W1988114663","https://openalex.org/W1989682699","https://openalex.org/W2017927472","https://openalex.org/W2033961328","https://openalex.org/W2049500052","https://openalex.org/W2051531384","https://openalex.org/W2057393374","https://openalex.org/W2058426370","https://openalex.org/W2084224084","https://openalex.org/W2089311600","https://openalex.org/W2097382431","https://openalex.org/W2102199027","https://openalex.org/W2151021662","https://openalex.org/W2545919726","https://openalex.org/W2584013203","https://openalex.org/W3145128584"],"related_works":["https://openalex.org/W7097386849","https://openalex.org/W7096822651","https://openalex.org/W1511191949","https://openalex.org/W2049500052","https://openalex.org/W1563931143","https://openalex.org/W2132275989","https://openalex.org/W3183276792","https://openalex.org/W2268320119","https://openalex.org/W3022326557","https://openalex.org/W66906462"],"abstract_inverted_index":{"Let":[0,296],"G":[1],"=":[2],"(V,":[3],"E,":[4],"w)":[5],"be":[6,179],"a":[7,31,38,67,201,211,216,232,253,317],"directed":[8],"graph,":[9],"where":[10],"w:":[11],"V":[12],"\u2192":[13],"R":[14],"is":[15,33,61,96,108,119,272,334,356],"an":[16,97,347],"arbitrary":[17,159],"weight":[18,36,65,315],"function":[19],"defined":[20],"on":[21,40,209,224,240],"its":[22],"vertices.":[23,92,344],"The":[24,106,163,327],"bottleneck":[25,49,64,85,294,314],"weight,":[26,50,215],"or":[27,51,148],"the":[28,34,41,48,52,62,74,84,103,111,120,128,132,151,188,192,249,277,300,312,350],"capacity,":[29,53],"of":[30,37,66,91,113,191,203,213,218,234,261,276,283,292,316,343],"path":[32,68,318],"smallest":[35],"vertex":[39,149,161],"path.":[42],"For":[43,259],"two":[44],"vertices":[45],"u,":[46],"v":[47,322],"from":[54,69,110,303,319],"u":[55,70,304,320],"to":[56,71,82,141,181,274,288,305,321,335],"v,":[57,306],"denoted":[58],"c(u,":[59],"v),":[60],"maximum":[63,214,242,293,313],"v.":[72],"In":[73],"All-Pairs":[75,328],"Bottleneck":[76,329],"Paths":[77,331],"(APBP)":[78],"problem":[79,156,165,251,333,352],"we":[80,264],"have":[81,174],"find":[83],"weights":[86],"for":[87,102,124,131,154,158,195,244,256,339,349],"all":[88,340],"ordered":[89,341],"pairs":[90,342],"Our":[93,117],"main":[94],"result":[95,202,217,233],"O(n":[98,357],"2.575)":[99],"time":[100,355],"algorithm":[101,118,123,130,152,285,348],"APBP":[104,155,164,250,278],"problem.":[105,126,279],"exponent":[107,112],"derived":[109],"fast":[114],"matrix":[115,246],"multiplication.":[116,247],"first":[121],"sub-cubic":[122,129],"this":[125],"Unlike":[127],"all-pairs":[133],"shortest":[134,290],"paths":[135,291],"(APSP)":[136],"problem,":[137],"that":[138,173,269,275],"only":[139],"applies":[140],"bounded":[142],"(or":[143],"relatively":[144],"small)":[145],"integer":[146],"edge":[147],"weights,":[150],"presented":[153],"works":[157],"large":[160],"weights.":[162],"has":[166],"numerous":[167],"applications,":[168],"and":[169,205,231,236,307],"several":[170],"interesting":[171],"problems":[172],"recently":[175],"attracted":[176],"attention":[177],"can":[178,265],"reduced":[180],"it,":[182],"with":[183],"no":[184],"asymptotic":[185],"loss":[186],"in":[187,229,266],"running":[189,354],"times":[190],"known":[193],"algorithms":[194],"these":[196,257,262],"problems.":[197],"Some":[198],"examples":[199],"are":[200],"Vassilevska":[204],"Williams":[206],"[STOC":[207],"2006]":[208],"finding":[210,241],"triangle":[212],"Bender":[219],"et":[220],"al.":[221],"[SODA":[222],"2001]":[223],"computing":[225],"least":[226],"common":[227],"ancestors":[228],"DAGs":[230],"Kowaluk":[235],"Lingas":[237],"[ICALP":[238],"2005]":[239],"witnesses":[243],"boolean":[245],"Thus,":[248],"provides":[252],"uniform":[254],"framework":[255],"applications.":[258],"some":[260],"problems,":[263],"fact":[267],"show":[268],"their":[270],"complexity":[271],"equivalent":[273],"A":[280],"slight":[281],"modification":[282],"our":[284],"enables":[286],"us":[287],"compute":[289,336],"weight.":[295],"d(u,":[297,325],"v)":[298,310,338],"denote":[299,311],"(unweighted)":[301],"distance":[302],"let":[308],"sc(u,":[309,337],"having":[323],"length":[324],"v).":[326],"Shortest":[330],"(APBSP)":[332],"We":[345],"present":[346],"APBSP":[351],"whose":[353],"2.86).":[358],"1":[359]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1986208679","counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
