{"id":"https://openalex.org/W2056991815","doi":"https://doi.org/10.1137/s0097539791199334","title":"Improved Algorithms for Bipartite Network Flow","display_name":"Improved Algorithms for Bipartite Network Flow","publication_year":1994,"publication_date":"1994-10-01","ids":{"openalex":"https://openalex.org/W2056991815","doi":"https://doi.org/10.1137/s0097539791199334","mag":"2056991815"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539791199334","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539791199334","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/A5106764134","display_name":"Ravindra K. Ahuja","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ravindra K. Ahuja","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072685560","display_name":"James B. Orlin","orcid":"https://orcid.org/0000-0002-7488-094X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"James B. Orlin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054641291","display_name":"Clifford Stein","orcid":"https://orcid.org/0000-0002-0614-6620"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Clifford Stein","raw_affiliation_strings":[],"affiliations":[]},{"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":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5106764134"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.5631,"has_fulltext":false,"cited_by_count":146,"citation_normalized_percentile":{"value":0.96851775,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"23","issue":"5","first_page":"906","last_page":"933"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9979000091552734,"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.9954000115394592,"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/bipartite-graph","display_name":"Bipartite graph","score":0.7976901531219482},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5936055779457092},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5915762186050415},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5479360818862915},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5173037052154541},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4960063397884369},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4434337913990021},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42324477434158325},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3334324359893799},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1321873962879181}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7976901531219482},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5936055779457092},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5915762186050415},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5479360818862915},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5173037052154541},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4960063397884369},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4434337913990021},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42324477434158325},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3334324359893799},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1321873962879181}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539791199334","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539791199334","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.55.613","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.613","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.dartmouth.edu/~cliff/papers/BipartiteFlow.ps.Z","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":32,"referenced_works":["https://openalex.org/W1493391054","https://openalex.org/W1513400187","https://openalex.org/W1552561242","https://openalex.org/W1967810725","https://openalex.org/W1970403725","https://openalex.org/W1978583881","https://openalex.org/W1980289219","https://openalex.org/W1991295190","https://openalex.org/W2001274023","https://openalex.org/W2004350101","https://openalex.org/W2004618348","https://openalex.org/W2006254094","https://openalex.org/W2013469283","https://openalex.org/W2018804864","https://openalex.org/W2029266474","https://openalex.org/W2042706982","https://openalex.org/W2042803872","https://openalex.org/W2046043928","https://openalex.org/W2048285065","https://openalex.org/W2059772103","https://openalex.org/W2061670230","https://openalex.org/W2061872629","https://openalex.org/W2062931369","https://openalex.org/W2065320942","https://openalex.org/W2077123737","https://openalex.org/W2081013866","https://openalex.org/W2090359754","https://openalex.org/W2109567578","https://openalex.org/W2130055503","https://openalex.org/W2130566259","https://openalex.org/W3014094413","https://openalex.org/W4213060883"],"related_works":["https://openalex.org/W4309591652","https://openalex.org/W2089088747","https://openalex.org/W4297882665","https://openalex.org/W2026407613","https://openalex.org/W2952349276","https://openalex.org/W2021702479","https://openalex.org/W2770134917","https://openalex.org/W2369757561","https://openalex.org/W2018678447","https://openalex.org/W1988771411"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"network":[3,12,80],"flow":[4,103],"algorithms":[5,104,141],"for":[6],"bipartite":[7,18,79],"networks":[8],"are":[9,207],"studied.":[10],"A":[11,78],"$G":[13],"=":[14,53,56,61,65],"(V,E)$":[15],"is":[16,81,94,98,121,155,200],"called":[17,82],"if":[19,84],"its":[20],"vertex":[21],"set":[22],"V":[23],"can":[24,105],"be":[25,106],"partitioned":[26],"into":[27],"two":[28],"subsets":[29],"$V_1":[30,43,136],"$":[31,34,44,88,148],"and":[32,45,67,89,138,164,177,184,217],"$V_2":[33,49],"such":[35],"that":[36,73,100,126,157,178],"all":[37],"edges":[38],"have":[39],"one":[40,128],"endpoint":[41],"in":[42,48,118,135,170,190],"the":[46,158,179,201],"other":[47],"$.":[50,77],"Let":[51],"$n":[52],"|V|$,":[54],"$n_1":[55,74,85,147],"|V_1":[57],"|$":[58],",":[59],"$n_2":[60],"|V_2":[62],"|$,":[63],"$m":[64],"|E|$":[66],"assume":[68],"without":[69],"loss":[70],"of":[71,162,182],"generality":[72],"\\leqslant":[75],"n_2":[76,87],"unbalanced":[83,113],"\\ll":[86],"balanced":[90],"otherwise.":[91],"(This":[92],"notion":[93],"necessarily":[95],"imprecise.)":[96],"It":[97],"shown":[99,156],"several":[101],"maximum":[102,215],"substantially":[107],"sped":[108],"up":[109],"when":[110],"applied":[111],"to":[112,129,133,210],"networks.":[114],"The":[115],"basic":[116],"idea":[117],"these":[119],"improvements":[120],"a":[122],"two-edge":[123,159],"push":[124,160],"rule":[125],"allows":[127],"\u201ccharge\u201d":[130],"most":[131],"computation":[132],"vertices":[134],"$,":[137],"hence":[139],"develop":[140],"whose":[142],"running":[143],"times":[144],"depend":[145],"on":[146],"rather":[149],"than":[150],"n.":[151],"For":[152],"example,":[153],"it":[154],"version":[161,181],"Goldberg":[163],"Tarjan\u2019s":[165],"FIFO":[166],"preflow-push":[167],"algorithm":[168,188],"runs":[169,189],"$O(n_1":[171,191],"m":[172,192],"+":[173,193],"n_1^3":[174],")$":[175],"time":[176],"analogous":[180],"Ahuja":[183],"Orlin\u2019s":[185],"excess":[186],"scaling":[187],"n_1^2":[194],"\\log":[195],"U)$":[196],"time,":[197],"where":[198],"U":[199],"largest":[202],"edge":[203],"capacity.":[204],"These":[205],"ideas":[206],"also":[208],"extended":[209],"dynamic":[211],"tree":[212],"implementations,":[213],"parametric":[214],"flows,":[216],"minimum-cost":[218],"flows.":[219]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":14},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}