{"id":"https://openalex.org/W2029266474","doi":"https://doi.org/10.1137/0218072","title":"Analysis of Preflow Push Algorithms for Maximum Network Flow","display_name":"Analysis of Preflow Push Algorithms for Maximum Network Flow","publication_year":1989,"publication_date":"1989-12-01","ids":{"openalex":"https://openalex.org/W2029266474","doi":"https://doi.org/10.1137/0218072","mag":"2029266474"},"language":"en","primary_location":{"id":"doi:10.1137/0218072","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218072","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/A5046805470","display_name":"Joseph Cheriyan","orcid":"https://orcid.org/0000-0003-0316-7650"},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"J. Cheriyan","raw_affiliation_strings":["Computer Science Group, Tata Institute of Fundamental Research Colaba, Bombay, India"],"affiliations":[{"raw_affiliation_string":"Computer Science Group, Tata Institute of Fundamental Research Colaba, Bombay, India","institution_ids":["https://openalex.org/I11947397"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113882894","display_name":"Sachin Maheshwari","orcid":"https://orcid.org/0000-0003-3992-7711"},"institutions":[{"id":"https://openalex.org/I64295750","display_name":"Indian Institute of Technology Indore","ror":"https://ror.org/01hhf7w52","country_code":"IN","type":"education","lineage":["https://openalex.org/I64295750"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"S. N. Maheshwari","raw_affiliation_strings":["[Department of Computer Science and Engineering, Indian Institute of Technology, New Delhi, India]"],"affiliations":[{"raw_affiliation_string":"[Department of Computer Science and Engineering, Indian Institute of Technology, New Delhi, India]","institution_ids":["https://openalex.org/I64295750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5046805470"],"corresponding_institution_ids":["https://openalex.org/I11947397"],"apc_list":null,"apc_paid":null,"fwci":7.0204,"has_fulltext":false,"cited_by_count":106,"citation_normalized_percentile":{"value":0.97911383,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"18","issue":"6","first_page":"1057","last_page":"1086"},"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.9998000264167786,"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.9998000264167786,"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.9987999796867371,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9973999857902527,"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/maximum-flow-problem","display_name":"Maximum flow problem","score":0.7774559855461121},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6884336471557617},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6655464172363281},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5673575401306152},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.5575215816497803},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5270445942878723},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4607390761375427},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3838465213775635}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.7774559855461121},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6884336471557617},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6655464172363281},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5673575401306152},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.5575215816497803},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5270445942878723},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4607390761375427},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3838465213775635},{"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/0218072","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218072","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":[{"id":"https://openalex.org/F4320321091","display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","ror":"https://ror.org/00x0ma614"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W170524977","https://openalex.org/W1493391054","https://openalex.org/W1513400187","https://openalex.org/W2007470648","https://openalex.org/W2028155031","https://openalex.org/W2046043928","https://openalex.org/W2085038198","https://openalex.org/W2090359754","https://openalex.org/W2092534058","https://openalex.org/W2123806189","https://openalex.org/W2154501376","https://openalex.org/W2467648627","https://openalex.org/W3014094413"],"related_works":["https://openalex.org/W2905721092","https://openalex.org/W2004145957","https://openalex.org/W2378464885","https://openalex.org/W2029930003","https://openalex.org/W2159377379","https://openalex.org/W3083664609","https://openalex.org/W2963699585","https://openalex.org/W3096298301","https://openalex.org/W4385370040","https://openalex.org/W3025390008"],"abstract_inverted_index":{"The":[0,98],"class":[1],"of":[2,140],"preflow":[3,41,81,95,101],"push":[4,42,82,96,102],"algorithms":[5,160],"recently":[6],"introduced":[7],"by":[8,60],"Goldberg":[9,30],"and":[10,25,31,51,84,107,119,149],"Tarjan":[11],"for":[12,37,78,92,135,161],"solving":[13],"the":[14,38,71,79,85,93,128,136,156],"maximum":[15,132],"flow":[16,133],"problem":[17],"on":[18,126],"a":[19,62,131],"weighted":[20],"digraph":[21],"with":[22],"n":[23],"vertices":[24],"m":[26,49,116,146],"edges":[27],"is":[28,44,53,58,67,76,90,104,109,123],"studied.":[29],"Tarjan\u2019s":[32],"$O(n^3":[33,72],")$":[34,73,117,147,151],"time":[35,74,88],"bound":[36,57,75,89,122],"highest":[39],"distance":[40],"algorithm":[43,103,134],"improved":[45],"to":[46],"$O(n^2":[47,86,114,144,150],"\\sqrt":[48,115,145],")$,":[50],"it":[52,108,112],"shown":[54,69,110],"that":[55,70,111,120,142],"this":[56,121,162],"tight":[59,77,91],"constructing":[61],"parametrized":[63],"worst-case":[64],"network.":[65],"It":[66],"also":[68],"FIFO":[80],"algorithm,":[83],"m)$":[87],"LIFO":[94],"algorithm.":[97],"maximal":[99],"excess":[100],"then":[105],"developed,":[106],"performs":[113],"pushes":[118],"tight.":[124],"Based":[125],"this,":[127],"authors":[129],"develop":[130],"synchronous":[137],"distributed":[138],"model":[139],"computation":[141],"uses":[143],"messages":[148],"time,":[152],"thereby":[153],"improving":[154],"upon":[155],"best":[157],"previously":[158],"known":[159],"model.":[163]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":14},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}