{"id":"https://openalex.org/W2046043928","doi":"https://doi.org/10.1137/0218065","title":"Improved Time Bounds for the Maximum Flow Problem","display_name":"Improved Time Bounds for the Maximum Flow Problem","publication_year":1989,"publication_date":"1989-10-01","ids":{"openalex":"https://openalex.org/W2046043928","doi":"https://doi.org/10.1137/0218065","mag":"2046043928"},"language":"en","primary_location":{"id":"doi:10.1137/0218065","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218065","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":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1721.1/48078","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5106764134","display_name":"Ravindra K. Ahuja","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ravindra K. Ahuja","raw_affiliation_strings":["Massachusetts Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072685560","display_name":"James B. Orlin","orcid":"https://orcid.org/0000-0002-7488-094X"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James B. Orlin","raw_affiliation_strings":["Massachusetts Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert E. Tarjan","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5106764134"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":10.5348,"has_fulltext":false,"cited_by_count":143,"citation_normalized_percentile":{"value":0.98975964,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"18","issue":"5","first_page":"939","last_page":"954"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"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.9987999796867371,"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/mathematics","display_name":"Mathematics","score":0.6247443556785583},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.618401288986206},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5575347542762756},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5202202200889587},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5090433955192566},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5007574558258057},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.49327248334884644},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.48767006397247314},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48586055636405945},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47444260120391846},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4598369002342224},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.45360881090164185},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3301509618759155},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2501692771911621},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.20070314407348633}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6247443556785583},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.618401288986206},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5575347542762756},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5202202200889587},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5090433955192566},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5007574558258057},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.49327248334884644},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.48767006397247314},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48586055636405945},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47444260120391846},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4598369002342224},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.45360881090164185},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3301509618759155},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2501692771911621},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.20070314407348633},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.1137/0218065","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218065","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1012.538","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1012.538","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dtic.mil/get-tr-doc/pdf?AD%3DADA194034%26Location%3DU2%26doc%3DGetTRDoc.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1023.9907","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1023.9907","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dspace.mit.edu/bitstream/handle/1721.1/48196/improvedtimeboun00ahuj.pdf%3Bjsessionid%3D8F8A5CFBC9BE3D798FB047B2990AD0D1?sequence%3D1","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1026.7795","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1026.7795","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dspace.mit.edu/bitstream/handle/1721.1/48078/improvedtimebounx00ahuj.pdf%3Bjsessionid%3D00587724CD0C9DBE6F75B331394473BD?sequence%3D1","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.91.5704","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.5704","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dspace.mit.edu/bitstream/1721.1/5267/1/OR-176-88-24515868.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.93.2743","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.2743","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.mit.edu/jorlin/www/otheroldpapers/29-improved time bounds.pdf","raw_type":"text"},{"id":"pmh:oai:dspace.mit.edu:1721.1/48078","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/48078","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Working Paper"},{"id":"pmh:oai:dspace.mit.edu:1721.1/48196","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/48196","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Working Paper"},{"id":"pmh:oai:dspace.mit.edu:1721.1/5267","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/5267","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Working Paper"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/48078","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/48078","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Working Paper"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2771443444","display_name":"New Themes in the Design and Analysis of Data Structures","funder_award_id":"8605962","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1493391054","https://openalex.org/W1513400187","https://openalex.org/W1964119857","https://openalex.org/W1991295190","https://openalex.org/W2007470648","https://openalex.org/W2018804864","https://openalex.org/W2029266474","https://openalex.org/W2053913299","https://openalex.org/W2061872629","https://openalex.org/W2069323107","https://openalex.org/W2075322358","https://openalex.org/W2081013866","https://openalex.org/W2090359754","https://openalex.org/W2109567578","https://openalex.org/W2125690626","https://openalex.org/W2130055503","https://openalex.org/W2139559590","https://openalex.org/W2149342630","https://openalex.org/W2340365916"],"related_works":["https://openalex.org/W2055932080","https://openalex.org/W4377371889","https://openalex.org/W2113270940","https://openalex.org/W1992470151","https://openalex.org/W1992104669","https://openalex.org/W2521054645","https://openalex.org/W2113623403","https://openalex.org/W2018076478","https://openalex.org/W1870020915","https://openalex.org/W2887154986"],"abstract_inverted_index":{"Recently,":[0],"Goldberg":[1],"proposed":[2],"a":[3,15,39,44,58,112,198,206],"new":[4],"approach":[5,13],"to":[6,89,159,228],"the":[7,29,90,132,136,146,152,156,173,189,212,225,230,233],"maximum":[8],"network":[9],"flow":[10],"problem.":[11],"The":[12,192],"yields":[14,38],"very":[16],"simple":[17],"algorithm":[18,42,62,92,134,138,154],"running":[19,45,98,157],"in":[20,68,151,181,210,232],"$O(n^3":[21],")$":[22,127],"time":[23,46,74,99,158,226],"on":[24,51,75],"n-vertex":[25],"networks.":[26,53],"Incorporation":[27],"of":[28,34,47,60,100,121,139,148,176,188,219],"dynamic":[30,149],"tree":[31],"data":[32],"structure":[33],"Sleator":[35],"and":[36,55,66],"Tarjan":[37],"more":[40],"complicated":[41],"with":[43,77,135],"$O(nm\\log":[48,160],"(n^2":[49,71],"/m)$":[50],"m-arc":[52],"Ahuja":[54],"Orlin":[56],"developed":[57],"variant":[59],"Goldberg\u2019s":[61],"that":[63,145,172],"uses":[64],"scaling":[65,114],"runs":[67],"$O(nm":[69,101,122],"+":[70,102,123,167],"\\log":[72,104,106],"U)$":[73,107],"networks":[76],"integer":[78],"arc":[79],"capacities":[80],"bounded":[81],"by":[82,110,130,185,215],"U.":[83],"In":[84],"this":[85],"paper":[86],"possible":[87],"improvements":[88],"Ahuja-Orlin":[91,133],"are":[93,195],"explored.":[94],"First,":[95],"an":[96,117,216],"improved":[97],"n^2":[103,124],"U/\\log":[105],"is":[108,128,143,205,224],"obtained":[109,129,184],"using":[111,186],"nonconstant":[113],"factor.":[115],"Second,":[116],"even":[118],"better":[119],"bound":[120],"(\\log":[125],"U)^{1/2}":[126],"combining":[131],"wave":[137],"Tarjan.":[140],"Third,":[141],"it":[142],"shown":[144],"use":[147,175],"trees":[150],"latter":[153],"reduces":[155],"(({n":[161],"/":[162,165],"m})(\\log":[163],"U)^{{1":[164],"2}}":[166],"2))$.":[168],"This":[169],"result":[170],"shows":[171],"combined":[174],"three":[177],"different":[178],"techniques,":[179],"results":[180],"speed":[182],"not":[183],"any":[187],"techniques":[190],"alone.":[191],"above":[193],"bounds":[194,213],"all":[196],"for":[197],"unit-cost":[199],"random":[200],"access":[201],"machine.":[202],"Also":[203],"considered":[204],"semilogarithmic":[207],"computation":[208],"model":[209],"which":[211,223],"increase":[214],"additive":[217],"term":[218],"$O(m\\log":[220],"_n":[221],"U)$,":[222],"needed":[227],"read":[229],"input":[231],"model.":[234]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":18},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}