{"id":"https://openalex.org/W2013469283","doi":"https://doi.org/10.1137/0218003","title":"A Fast Parametric Maximum Flow Algorithm and Applications","display_name":"A Fast Parametric Maximum Flow Algorithm and Applications","publication_year":1989,"publication_date":"1989-02-01","ids":{"openalex":"https://openalex.org/W2013469283","doi":"https://doi.org/10.1137/0218003","mag":"2013469283"},"language":"en","primary_location":{"id":"doi:10.1137/0218003","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218003","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/A5090391520","display_name":"Giorgio Gallo","orcid":"https://orcid.org/0000-0003-4818-7508"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Giorgio Gallo","raw_affiliation_strings":["University of Pisa, Pisa, Italy ("],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Pisa, Pisa, Italy (","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084098678","display_name":"Michael D. Grigoriadis","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael D. Grigoriadis","raw_affiliation_strings":["Rutgers UNiv., New Brunswick, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers UNiv., New Brunswick, NJ","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert E. Tarjan","raw_affiliation_strings":["Princeton Univ., Princeton , NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton Univ., Princeton , NJ","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5090391520"],"corresponding_institution_ids":["https://openalex.org/I108290504"],"apc_list":null,"apc_paid":null,"fwci":9.1762,"has_fulltext":false,"cited_by_count":589,"citation_normalized_percentile":{"value":0.97812034,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"18","issue":"1","first_page":"30","last_page":"55"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9968000054359436,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9968000054359436,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9912999868392944,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.8724719285964966},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6337252855300903},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5936819911003113},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.5824238061904907},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5484538674354553},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5269399881362915},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5233556628227234},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.5220919847488403},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.46100398898124695},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4387180209159851},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2951086759567261},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.2712562084197998},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06435573101043701}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.8724719285964966},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6337252855300903},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5936819911003113},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.5824238061904907},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5484538674354553},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5269399881362915},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5233556628227234},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.5220919847488403},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.46100398898124695},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4387180209159851},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2951086759567261},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.2712562084197998},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06435573101043701},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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":1,"locations":[{"id":"doi:10.1137/0218003","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218003","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W176142888","https://openalex.org/W183656749","https://openalex.org/W1513400187","https://openalex.org/W1569458199","https://openalex.org/W1966844921","https://openalex.org/W1967956032","https://openalex.org/W1971057413","https://openalex.org/W1999218360","https://openalex.org/W2006254094","https://openalex.org/W2010042187","https://openalex.org/W2012959686","https://openalex.org/W2018804864","https://openalex.org/W2027029507","https://openalex.org/W2028576516","https://openalex.org/W2042274567","https://openalex.org/W2042803872","https://openalex.org/W2044687755","https://openalex.org/W2048285065","https://openalex.org/W2065320942","https://openalex.org/W2067936976","https://openalex.org/W2075710887","https://openalex.org/W2083289733","https://openalex.org/W2086252904","https://openalex.org/W2090359754","https://openalex.org/W2096521993","https://openalex.org/W2113834527","https://openalex.org/W2125690626","https://openalex.org/W2128208761","https://openalex.org/W2128805075","https://openalex.org/W2129391890","https://openalex.org/W2130055503","https://openalex.org/W2141546571","https://openalex.org/W2167925113","https://openalex.org/W2182811131","https://openalex.org/W2250294758","https://openalex.org/W3014094413","https://openalex.org/W4206663876","https://openalex.org/W4238748775","https://openalex.org/W4247216616"],"related_works":["https://openalex.org/W3161514703","https://openalex.org/W3035974271","https://openalex.org/W1994440468","https://openalex.org/W2625547693","https://openalex.org/W2098682899","https://openalex.org/W3141113327","https://openalex.org/W2182648737","https://openalex.org/W2590727506","https://openalex.org/W2080904092","https://openalex.org/W4206915070"],"abstract_inverted_index":{"The":[0],"classical":[1],"maximum":[2,39,59,71,89],"flow":[3,40,60,72,90],"problem":[4],"sometimes":[5],"occurs":[6],"in":[7,9,100],"settings":[8],"which":[10],"the":[11,25,30,33,37,49,69,93,116],"arc":[12],"capacities":[13],"are":[14,18],"not":[15],"fixed":[16],"but":[17],"functions":[19],"of":[20,32,57,74,86,95,110],"a":[21,55,97,108],"single":[22],"parameter,":[23],"and":[24,76],"goal":[26],"is":[27,66],"to":[28,81],"find":[29],"value":[31,52],"parameter":[34,51],"such":[35,87],"that":[36,68],"corresponding":[38],"or":[41],"minimum":[42],"cut":[43],"satisfies":[44],"some":[45],"side":[46],"condition.":[47],"Finding":[48],"desired":[50],"requires":[53],"solving":[54],"sequence":[56],"related":[58],"problems.":[61],"In":[62],"this":[63],"paper":[64],"it":[65],"shown":[67],"recent":[70],"algorithm":[73],"Goldberg":[75],"Tarjan":[77],"can":[78],"be":[79],"extended":[80],"solve":[82],"an":[83],"important":[84],"class":[85],"parametric":[88],"problems,":[91],"at":[92],"cost":[94],"only":[96],"constant":[98],"factor":[99],"its":[101],"worst-case":[102],"time":[103],"bound.":[104],"Faster":[105],"algorithms":[106],"for":[107],"variety":[109],"combinatorial":[111],"optimization":[112],"problems":[113],"follow":[114],"from":[115],"result.":[117]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":18},{"year":2023,"cited_by_count":18},{"year":2022,"cited_by_count":19},{"year":2021,"cited_by_count":26},{"year":2020,"cited_by_count":20},{"year":2019,"cited_by_count":37},{"year":2018,"cited_by_count":18},{"year":2017,"cited_by_count":17},{"year":2016,"cited_by_count":17},{"year":2015,"cited_by_count":37},{"year":2014,"cited_by_count":26},{"year":2013,"cited_by_count":22},{"year":2012,"cited_by_count":19}],"updated_date":"2026-05-09T13:55:54.758798","created_date":"2025-10-10T00:00:00"}