{"id":"https://openalex.org/W3107976745","doi":"https://doi.org/10.1002/net.22001","title":"A fast maximum flow algorithm","display_name":"A fast maximum flow algorithm","alternate_titles":[],"publication_year":2020,"publication_date":"2020-11-26","ids":{"openalex":"https://openalex.org/W3107976745","doi":"https://doi.org/10.1002/net.22001","mag":"3107976745"},"language":"en","primary_location":{"id":"doi:10.1002/net.22001","doi":"https://doi.org/10.1002/net.22001","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.22001","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","ccf-c","cwts-core","dongbi-b","jufo-2","norway-1","poland-140","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W3107976745"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1910.04848","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072685560","display_name":"James B. Orlin","orcid":"https://orcid.org/0000-0002-7488-094X","observed_orcids":["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":true,"contributor_roles":[],"raw_author_name":"James B. Orlin","raw_affiliation_strings":["MIT, Cambridge, Massachusetts, USA"],"raw_orcid":"https://orcid.org/0000-0002-7488-094X","affiliations":[{"raw_affiliation_string":"MIT, Cambridge, Massachusetts, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016607420","display_name":"X Gong","orcid":"https://orcid.org/0000-0002-3534-0473","observed_orcids":["https://orcid.org/0000-0002-3534-0473"]},"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,"contributor_roles":[],"raw_author_name":"Xiao\u2010yue Gong","raw_affiliation_strings":["MIT, Cambridge, Massachusetts, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, Massachusetts, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5072685560"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":{"value":2500,"currency":"USD","value_usd":2500},"apc_paid":null,"fwci":1.9501,"has_fulltext":true,"cited_by_count":15,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.86244019,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":97},"biblio":{"volume":"77","issue":"2","first_page":"287","last_page":"321"},"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":0.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/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/maximum-flow","display_name":"maximum flow","score":0.9150000214576721},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.4909999966621399},{"id":"https://openalex.org/keywords/sparse-graphs","display_name":"sparse graphs","score":0.7250000238418579},{"id":"https://openalex.org/keywords/dynamic-trees","display_name":"dynamic trees","score":0.7139999866485596},{"id":"https://openalex.org/keywords/flow-algorithms","display_name":"flow algorithms","score":0.41200000047683716}],"concepts":[{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.7894880771636963},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6676281690597534},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6427509784698486},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5153242945671082},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49357616901397705},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4723794758319855},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.46894121170043945},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44289037585258484},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4171094298362732},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3880213797092438},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1002/net.22001","doi":"https://doi.org/10.1002/net.22001","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.22001","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","ccf-c","cwts-core","dongbi-b","jufo-2","norway-1","poland-140","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1910.04848","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1910.04848","pdf_url":"https://arxiv.org/pdf/1910.04848","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:dspace.mit.edu:1721.1/134021","doi":null,"is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/134021","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,"listed_in":[],"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-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv","raw_type":"Article"},{"id":"doi:10.48550/arxiv.1910.04848","doi":"https://doi.org/10.48550/arxiv.1910.04848","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1910.04848","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1910.04848","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1910.04848","pdf_url":"https://arxiv.org/pdf/1910.04848","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G8128692411","display_name":null,"funder_award_id":"N00014\u201017\u20101\u20102194","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3107976745.pdf","grobid_xml":"https://content.openalex.org/works/W3107976745.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1977545325","https://openalex.org/W1983383464","https://openalex.org/W1992170089","https://openalex.org/W2002531683","https://openalex.org/W2007470648","https://openalex.org/W2018804864","https://openalex.org/W2046043928","https://openalex.org/W2084364487","https://openalex.org/W2084990336","https://openalex.org/W2090359754","https://openalex.org/W2099463627","https://openalex.org/W2103985627","https://openalex.org/W2109567578","https://openalex.org/W2128031234","https://openalex.org/W2139559590","https://openalex.org/W2147965279","https://openalex.org/W2149342630","https://openalex.org/W2156036190","https://openalex.org/W2338905098","https://openalex.org/W3014094413","https://openalex.org/W4213060235","https://openalex.org/W4213060883","https://openalex.org/W6993018244"],"related_works":["https://openalex.org/W1983383464","https://openalex.org/W7101036494","https://openalex.org/W6991654897","https://openalex.org/W850751334","https://openalex.org/W1543904360","https://openalex.org/W2109567578","https://openalex.org/W2141038472","https://openalex.org/W2384630160","https://openalex.org/W2982534635"],"abstract_inverted_index":{"In":[0],"2013,":[1],"Orlin":[2],"proved":[3],"that":[4,99],"the":[5,25,35,41,60,65,74,78,92],"max":[6,66],"flow":[7,67],"problem":[8,68],"could":[9],"be":[10],"solved":[11],"in":[12,18,86],"O(nm)":[13],"time.":[14],"His":[15],"algorithm":[16,47,63,79,97,112],"ran":[17],"O(nm":[19],"+":[20],"m1.94)":[21],"time,":[22],"which":[23,87],"was":[24,37,45],"fastest":[26,42],"for":[27,64],"graphs":[28,85],"with":[29],"fewer":[30],"than":[31],"n1.06":[32],"arcs.":[33],"If":[34],"graph":[36],"not":[38],"sufficiently":[39],"sparse,":[40],"running":[43,70,75,93],"time":[44,71,76,94],"an":[46],"due":[48],"to":[49],"King,":[50],"Rao,":[51],"and":[52],"Tarjan.":[53],"We":[54],"describe":[55],"a":[56,105],"new":[57],"variant":[58],"of":[59,77,95,100,107],"excess":[61],"scaling":[62],"whose":[69],"strictly":[72],"dominates":[73,98],"by":[80,104],"King":[81,101],"et":[82,102],"al.":[83,103],"For":[84],"m":[88],"=":[89],"O(nlog":[90],"n),":[91],"our":[96,111],"factor":[106],"O(loglog":[108],"n).":[109],"Moreover,":[110],"achieves":[113],"this":[114],"improved":[115],"performance":[116],"without":[117],"reliance":[118],"on":[119],"dynamic":[120],"trees.":[121]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3107976745","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3}],"updated_date":"2026-11-20T13:11:24.684918","created_date":"2020-12-07T00:00:00"}
