{"id":"https://openalex.org/W2039086323","doi":"https://doi.org/10.1137/0208012","title":"Maximum Flow in Planar Networks","display_name":"Maximum Flow in Planar Networks","publication_year":1979,"publication_date":"1979-05-01","ids":{"openalex":"https://openalex.org/W2039086323","doi":"https://doi.org/10.1137/0208012","mag":"2039086323"},"language":"en","primary_location":{"id":"doi:10.1137/0208012","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0208012","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/A5019800362","display_name":"Alon Itai","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alon Itai","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5018292222","display_name":"Yossi Shiloach","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yossi Shiloach","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019800362"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.6624,"has_fulltext":false,"cited_by_count":123,"citation_normalized_percentile":{"value":0.94858612,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"8","issue":"2","first_page":"135","last_page":"150"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9653000235557556,"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.9527000188827515,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/planarity-testing","display_name":"Planarity testing","score":0.8106221556663513},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.8077346682548523},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6691988706588745},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.6347763538360596},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6309316754341125},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6239102482795715},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6015380024909973},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5332555174827576},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47606131434440613},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4533008337020874},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.4295761287212372},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.42685720324516296},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.42435118556022644},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.41044771671295166},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39528578519821167},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30020737648010254},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08166816830635071}],"concepts":[{"id":"https://openalex.org/C68260962","wikidata":"https://www.wikidata.org/wiki/Q7200967","display_name":"Planarity testing","level":2,"score":0.8106221556663513},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.8077346682548523},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6691988706588745},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.6347763538360596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6309316754341125},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6239102482795715},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6015380024909973},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5332555174827576},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47606131434440613},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4533008337020874},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.4295761287212372},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.42685720324516296},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.42435118556022644},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.41044771671295166},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39528578519821167},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30020737648010254},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08166816830635071},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0208012","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0208012","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":5,"referenced_works":["https://openalex.org/W1551635709","https://openalex.org/W2008292658","https://openalex.org/W2149342630","https://openalex.org/W2313456371","https://openalex.org/W4213214460"],"related_works":["https://openalex.org/W2121204510","https://openalex.org/W2095284441","https://openalex.org/W2141353198","https://openalex.org/W3141688457","https://openalex.org/W3155269421","https://openalex.org/W2186707160","https://openalex.org/W4287692398","https://openalex.org/W3047118271","https://openalex.org/W3144947242","https://openalex.org/W2039086323"],"abstract_inverted_index":{"Efficient":[0],"algorithms":[1,12,25,107],"for":[2,58],"finding":[3],"maximum":[4],"flow":[5,65,81],"in":[6,101],"planar":[7],"networks":[8],"are":[9,19,34],"presented.":[10],"These":[11],"take":[13],"advantage":[14],"of":[15,41,66],"the":[16,22,29,32,36,55,91],"planarity":[17],"and":[18,31,45],"superior":[20],"to":[21,26,51],"most":[23],"efficient":[24],"date.":[27],"If":[28,90],"source":[30],"terminal":[33],"on":[35],"same":[37],"face,":[38],"an":[39],"algorithm":[40,84],"Berge":[42],"is":[43,49,69,76,93],"improved":[44],"its":[46],"time":[47],"complexity":[48],"reduced":[50],"$O(n\\log":[52],"n)$.":[53],"In":[54],"general":[56],"case,":[57],"a":[59,64,95],"given":[60],"$D":[61],">":[62],"0$":[63],"value":[67],"D":[68],"found":[70,100],"if":[71],"one":[72],"exists;":[73],"otherwise,":[74],"it":[75],"indicated":[77],"that":[78],"no":[79],"such":[80],"exists.":[82],"This":[83],"requires":[85],"$O(n^2":[86,102],"\\log":[87,103],"n)$":[88,104],"time.":[89,105],"network":[92],"undirected":[94],"minimum":[96],"cut":[97],"may":[98],"be":[99],"All":[106],"require":[108],"$O(n)$":[109],"space.":[110]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}