{"id":"https://openalex.org/W2075897105","doi":"https://doi.org/10.1002/net.3230090405","title":"Minimizing maximum flows in linear graphs","display_name":"Minimizing maximum flows in linear graphs","publication_year":1979,"publication_date":"1979-12-01","ids":{"openalex":"https://openalex.org/W2075897105","doi":"https://doi.org/10.1002/net.3230090405","mag":"2075897105"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230090405","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230090405","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,"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"},"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/A5036523452","display_name":"Donald F. Stanat","orcid":null},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"D. F. Stanat","raw_affiliation_strings":["University of North Carolina Chapel Hill, North Carolina","University of North Carolina , Chapel Hill, North Carolina"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of North Carolina Chapel Hill, North Carolina","institution_ids":["https://openalex.org/I114027177"]},{"raw_affiliation_string":"University of North Carolina , Chapel Hill, North Carolina","institution_ids":["https://openalex.org/I114027177"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054823878","display_name":"Gyula Mag\u00f3","orcid":null},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"G. A. Mag\u00f3","raw_affiliation_strings":["University of North Carolina Chapel Hill, North Carolina","University of North Carolina , Chapel Hill, North Carolina"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of North Carolina Chapel Hill, North Carolina","institution_ids":["https://openalex.org/I114027177"]},{"raw_affiliation_string":"University of North Carolina , Chapel Hill, North Carolina","institution_ids":["https://openalex.org/I114027177"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036523452"],"corresponding_institution_ids":["https://openalex.org/I114027177"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":2.4903,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.88341211,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"9","issue":"4","first_page":"333","last_page":"361"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9869999885559082,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9869999885559082,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9782000184059143,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9765999913215637,"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/sink","display_name":"Sink (geography)","score":0.6610248684883118},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.5138986110687256},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5019748210906982},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48156407475471497},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47763553261756897},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4741872251033783},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4525269567966461},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4354701042175293},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.41241368651390076},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.406990647315979}],"concepts":[{"id":"https://openalex.org/C143050476","wikidata":"https://www.wikidata.org/wiki/Q194502","display_name":"Sink (geography)","level":2,"score":0.6610248684883118},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.5138986110687256},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5019748210906982},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48156407475471497},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47763553261756897},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4741872251033783},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4525269567966461},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4354701042175293},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41241368651390076},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.406990647315979},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230090405","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230090405","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,"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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W289732966","https://openalex.org/W1655990431","https://openalex.org/W2029460931","https://openalex.org/W2073544767"],"related_works":["https://openalex.org/W2375873432","https://openalex.org/W4206915070","https://openalex.org/W2531764854","https://openalex.org/W3161514703","https://openalex.org/W2141299097","https://openalex.org/W1851375266","https://openalex.org/W2610002854","https://openalex.org/W3141113327","https://openalex.org/W4206407367","https://openalex.org/W3035974271"],"abstract_inverted_index":{"Abstract":[0],"We":[1,22,133],"define":[2],"a":[3,8,24,32,45,52,63,90],"linear":[4,28],"graph":[5,11],"to":[6,38,54,102,113],"be":[7,55,114],"connected":[9],"acyclic":[10],"each":[12,59],"of":[13,17,51,57,70,79,84,92],"whose":[14],"nodes":[15,37,101,104],"is":[16,89,111,118,128],"degree":[18],"one":[19],"or":[20],"two.":[21],"consider":[23],"flow":[25,124],"problem":[26],"in":[27,30],"graphs":[29],"which":[31,94],"commodity":[33,53,72,97],"flows":[34,93],"from":[35,98],"source":[36,42,100],"sink":[39,60,103],"nodes.":[40],"Each":[41],"node":[43,61],"has":[44,62],"specified":[46,64],"value":[47],"denoting":[48,66],"an":[49,81],"amount":[50,69],"disposed":[56],"and":[58,138],"capacity":[65],"the":[67,71,85,96,122],"maximum":[68],"it":[73,117],"can":[74],"absorb;":[75],"edges":[76],"are":[77],"capable":[78],"carrying":[80],"arbitrary":[82],"quantity":[83],"commodity.":[86],"A":[87,109],"solution":[88,110],"set":[91],"transports":[95],"all":[99],"without":[105],"overfilling":[106],"any":[107,126],"sink.":[108],"defined":[112],"optimal":[115,143],"if":[116],"minimax,":[119],"that":[120],"is,":[121],"largest":[123],"along":[125],"edge":[127],"as":[129,131],"small":[130],"possible.":[132],"describe":[134],"0(n":[135],"2":[136],")":[137],"0(n)":[139],"algorithms":[140],"for":[141],"finding":[142],"solutions.":[144]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}