{"id":"https://openalex.org/W2006254094","doi":"https://doi.org/10.1137/0216020","title":"Fast Algorithms for Bipartite Network Flow","display_name":"Fast Algorithms for Bipartite Network Flow","publication_year":1987,"publication_date":"1987-04-01","ids":{"openalex":"https://openalex.org/W2006254094","doi":"https://doi.org/10.1137/0216020","mag":"2006254094"},"language":"en","primary_location":{"id":"doi:10.1137/0216020","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0216020","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/A5062896251","display_name":"Dan Gusfield","orcid":"https://orcid.org/0000-0002-7469-5103"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dan Gusfield","raw_affiliation_strings":["YALE UNIVERSITY, New Haven, CT"],"affiliations":[{"raw_affiliation_string":"YALE UNIVERSITY, New Haven, CT","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065843083","display_name":"Charles U. Martel","orcid":"https://orcid.org/0000-0002-6797-5780"},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Charles Martel","raw_affiliation_strings":["university of california, davis"],"affiliations":[{"raw_affiliation_string":"university of california, davis","institution_ids":["https://openalex.org/I84218800"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070873690","display_name":"David Fern\u00e1ndez\u2010Baca","orcid":"https://orcid.org/0000-0002-8563-3637"},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Fernandez-Baca","raw_affiliation_strings":["university of california, davis"],"affiliations":[{"raw_affiliation_string":"university of california, davis","institution_ids":["https://openalex.org/I84218800"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5062896251"],"corresponding_institution_ids":["https://openalex.org/I32971472"],"apc_list":null,"apc_paid":null,"fwci":6.20787488,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.96835664,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"16","issue":"2","first_page":"237","last_page":"251"},"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.9995999932289124,"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.9995999932289124,"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.9991999864578247,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9385985732078552},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6099405884742737},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.6084874868392944},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5645875930786133},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5624421834945679},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5603224039077759},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.5101354718208313},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5096628665924072},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4349309504032135},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43311795592308044},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.430015504360199},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42960628867149353},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.4138997793197632},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35574451088905334},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.29511189460754395}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.9385985732078552},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6099405884742737},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6084874868392944},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5645875930786133},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5624421834945679},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5603224039077759},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.5101354718208313},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5096628665924072},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4349309504032135},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43311795592308044},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.430015504360199},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42960628867149353},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.4138997793197632},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35574451088905334},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29511189460754395},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0216020","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0216020","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1540572177","https://openalex.org/W1980289219","https://openalex.org/W2018804864","https://openalex.org/W2042706982","https://openalex.org/W2042803872","https://openalex.org/W2048285065","https://openalex.org/W2054145937","https://openalex.org/W2058817479","https://openalex.org/W2058858486","https://openalex.org/W2059772103","https://openalex.org/W2065320942","https://openalex.org/W2067936976","https://openalex.org/W2073821436","https://openalex.org/W2077123737","https://openalex.org/W2081013866","https://openalex.org/W2130055503","https://openalex.org/W2157503827","https://openalex.org/W2167925113","https://openalex.org/W2170569385","https://openalex.org/W4210546998"],"related_works":["https://openalex.org/W2091826982","https://openalex.org/W2968037521","https://openalex.org/W2036057584","https://openalex.org/W2107875203","https://openalex.org/W245205139","https://openalex.org/W2375873432","https://openalex.org/W4234658180","https://openalex.org/W4235849992","https://openalex.org/W4246000090","https://openalex.org/W2910933086"],"abstract_inverted_index":{"We":[0,15,136],"discuss":[1],"network":[2,95],"flow":[3,96,129,142,160],"in":[4,21,37,51,69,113],"a":[5,56,61],"bipartite":[6,98,128,141,159],"graph":[7],"G":[8],"with":[9],"node":[10,50],"sets":[11],"S":[12],"and":[13,27,92,120,153],"T.":[14],"show":[16,59],"that":[17,28,45,60,88],"Karzanov\u2019s":[18],"algorithm":[19,31,67],"runs":[20,68],"time":[22,70],"$O(|S|^2":[23],"|T|)$":[24],"on":[25,74,97,110,127,140,149],"G,":[26],"the":[29,38,42,46,65,83,111,124,145],"MPM":[30,66],"can":[32,89],"be":[33,90],"modified":[34,62],"to":[35,133,143],"run":[36],"same":[39],"bound.":[40],"For":[41],"common":[43,84],"case":[44],"degree":[47,109],"of":[48,64,78,86],"each":[49],"T":[52],"is":[53,163],"bounded":[54,108],"by":[55],"constant,":[57],"we":[58],"version":[63],"$O(|S|^3":[71,134],"+":[72],"|S||T|)$":[73],"G.":[75],"The":[76],"importance":[77],"these":[79],"results":[80,122,139],"comes":[81],"from":[82,130],"occurrence":[85],"problems":[87,157],"modeled":[91],"solved":[93],"using":[94],"graphs":[99],"where":[100,161],"$|S|":[101],"\\ll":[102],"|T|$.":[103],"In":[104],"many":[105],"applications":[106],"involving":[107,158],"nodes":[112],"T,":[114],"$|T|":[115],"=":[116],"\\theta":[117],"(|S|^2":[118],")$,":[119],"our":[121,138],"reduce":[123],"best":[125],"bounds":[126,148],"$O(|S|^6":[131],")$":[132],")$.":[135],"use":[137],"obtain":[144],"fastest":[146],"known":[147],"several":[150,155],"combinatorial":[151],"problems,":[152],"mention":[154],"additional":[156],"$|S|$":[162],"much":[164],"smaller":[165],"than":[166],"$|T|$.":[167]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}