{"id":"https://openalex.org/W2154501376","doi":"https://doi.org/10.1109/tit.1956.1056816","title":"A note on the maximum flow through a network","display_name":"A note on the maximum flow through a network","publication_year":1956,"publication_date":"1956-12-01","ids":{"openalex":"https://openalex.org/W2154501376","doi":"https://doi.org/10.1109/tit.1956.1056816","mag":"2154501376"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1956.1056816","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1956.1056816","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","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/A5034249483","display_name":"P. Eli\u00e1\u0161","orcid":null},"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,"raw_author_name":"P. Elias","raw_affiliation_strings":["Elec. Ena. Deot. and Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Elec. Ena. Deot. and Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066638302","display_name":"Amiel Feinstein","orcid":null},"institutions":[{"id":"https://openalex.org/I4210122954","display_name":"MIT Lincoln Laboratory","ror":"https://ror.org/022z6jk58","country_code":"US","type":"facility","lineage":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Feinstein","raw_affiliation_strings":["Lincoln Laboratory, M.I.T., Lexington, MA, USA"],"affiliations":[{"raw_affiliation_string":"Lincoln Laboratory, M.I.T., Lexington, MA, USA","institution_ids":["https://openalex.org/I4210122954"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012256930","display_name":"Chris Shannon","orcid":"https://orcid.org/0000-0002-2076-7888"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"C. Shannon","raw_affiliation_strings":["Bell Telephone Laboratories, Inc., Murray Hill, NJ, USA","M.I.T., Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Bell Telephone Laboratories, Inc., Murray Hill, NJ, USA","institution_ids":[]},{"raw_affiliation_string":"M.I.T., Cambridge, MA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5034249483"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":5.8033,"has_fulltext":false,"cited_by_count":452,"citation_normalized_percentile":{"value":0.95850202,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"2","issue":"4","first_page":"117","last_page":"119"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9587000012397766,"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"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9587000012397766,"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/T10142","display_name":"Formal Methods in Verification","score":0.9293000102043152,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9211000204086304,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.8436164855957031},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.6887072324752808},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6175306439399719},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5600228309631348},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.53458571434021},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5223744511604309},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.4870069622993469},{"id":"https://openalex.org/keywords/terminal","display_name":"Terminal (telecommunication)","score":0.45311155915260315},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43254250288009644},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.4213934540748596},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40920373797416687},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38696274161338806},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1413133442401886}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.8436164855957031},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6887072324752808},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6175306439399719},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5600228309631348},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.53458571434021},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5223744511604309},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.4870069622993469},{"id":"https://openalex.org/C2779664074","wikidata":"https://www.wikidata.org/wiki/Q3518405","display_name":"Terminal (telecommunication)","level":2,"score":0.45311155915260315},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43254250288009644},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.4213934540748596},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40920373797416687},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38696274161338806},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1413133442401886},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1956.1056816","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1956.1056816","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","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":0,"referenced_works":[],"related_works":["https://openalex.org/W3035974271","https://openalex.org/W3161514703","https://openalex.org/W2080904092","https://openalex.org/W4206915070","https://openalex.org/W1994440468","https://openalex.org/W3141113327","https://openalex.org/W2051329268","https://openalex.org/W2401819591","https://openalex.org/W89936677","https://openalex.org/W3159013657"],"abstract_inverted_index":{"This":[0,60],"note":[1],"discusses":[2],"the":[3,7,53],"problem":[4],"of":[5,9,21,24,27,74,80],"maximizing":[6],"rate":[8],"flow":[10,42],"from":[11,43],"one":[12],"terminal":[13],"to":[14,45,52,64],"another,":[15],"through":[16,47],"a":[17,22,30,37,48,66,72,78],"network":[18,49],"which":[19,28,71],"consists":[20],"number":[23,73,79],"branches,":[25],"each":[26],"has":[29],"limited":[31],"capacity.":[32],"The":[33,39],"main":[34],"result":[35],"is":[36,50,62],"theorem:":[38],"maximum":[40],"possible":[41],"left":[44],"right":[46],"equal":[51],"minimum":[54],"value":[55],"among":[56],"all":[57],"simple":[58],"cut-sets.":[59],"theorem":[61],"applied":[63],"solve":[65],"more":[67],"general":[68],"problem,":[69],"in":[70],"input":[75],"nodes":[76,82],"and":[77],"output":[81],"are":[83],"used.":[84]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":18},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":16},{"year":2019,"cited_by_count":26},{"year":2018,"cited_by_count":25},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":22},{"year":2015,"cited_by_count":17},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":35},{"year":2012,"cited_by_count":32}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}