{"id":"https://openalex.org/W1996470228","doi":"https://doi.org/10.1002/net.3230220307","title":"The optimal partitioning of networks","display_name":"The optimal partitioning of networks","publication_year":1992,"publication_date":"1992-05-01","ids":{"openalex":"https://openalex.org/W1996470228","doi":"https://doi.org/10.1002/net.3230220307","mag":"1996470228"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230220307","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220307","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/A5039615312","display_name":"Chung\u2010Kuan Cheng","orcid":"https://orcid.org/0000-0002-9865-8390"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chung\u2010Kuan Cheng","raw_affiliation_strings":["Computer Science and Engineering Department University of California, San Diego La Jolla, California 92093"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department University of California, San Diego La Jolla, California 92093","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039615312"],"corresponding_institution_ids":["https://openalex.org/I36258959"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":3.1772,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.90184605,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"22","issue":"3","first_page":"297","last_page":"315"},"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.9998999834060669,"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.9998999834060669,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9937999844551086,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9883000254631042,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.7501831650733948},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.7460947036743164},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6741229295730591},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6622250080108643},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5982358455657959},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5767843127250671},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5411893129348755},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5382395386695862},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5224658250808716},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.48996415734291077},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.4722033441066742},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4563785493373871},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.45612987875938416},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.4445376992225647},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.41853538155555725},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35313907265663147},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.22069981694221497},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07934954762458801}],"concepts":[{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.7501831650733948},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.7460947036743164},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6741229295730591},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6622250080108643},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5982358455657959},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5767843127250671},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5411893129348755},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5382395386695862},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5224658250808716},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.48996415734291077},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.4722033441066742},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4563785493373871},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.45612987875938416},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.4445376992225647},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.41853538155555725},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35313907265663147},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.22069981694221497},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07934954762458801},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230220307","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220307","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W115590081","https://openalex.org/W1569458199","https://openalex.org/W1577506665","https://openalex.org/W1972312685","https://openalex.org/W1982882434","https://openalex.org/W1994707866","https://openalex.org/W1996453957","https://openalex.org/W2003309297","https://openalex.org/W2006378656","https://openalex.org/W2011039300","https://openalex.org/W2018214829","https://openalex.org/W2033852356","https://openalex.org/W2035470297","https://openalex.org/W2035652501","https://openalex.org/W2044944864","https://openalex.org/W2059772103","https://openalex.org/W2060067940","https://openalex.org/W2065320942","https://openalex.org/W2067332418","https://openalex.org/W2072974175","https://openalex.org/W2084528420","https://openalex.org/W2086629796","https://openalex.org/W2095117703","https://openalex.org/W2096521993","https://openalex.org/W2115653324","https://openalex.org/W2125278290","https://openalex.org/W2141523221","https://openalex.org/W2150815458","https://openalex.org/W2152195131","https://openalex.org/W2161455936","https://openalex.org/W2161675672","https://openalex.org/W2168516786","https://openalex.org/W2170244590","https://openalex.org/W2611147814","https://openalex.org/W4213060883","https://openalex.org/W4213064273","https://openalex.org/W4230721931","https://openalex.org/W4231610975","https://openalex.org/W4236269389","https://openalex.org/W4238957840","https://openalex.org/W4251581428","https://openalex.org/W6681972069"],"related_works":["https://openalex.org/W3141688457","https://openalex.org/W2590727506","https://openalex.org/W2141353198","https://openalex.org/W2186707160","https://openalex.org/W2095284441","https://openalex.org/W3155269421","https://openalex.org/W2121204510","https://openalex.org/W1974018476","https://openalex.org/W647071796","https://openalex.org/W2377700283"],"abstract_inverted_index":{"Abstract":[0],"The":[1,27,40,53,107,115,157],"work":[2],"proposes":[3],"several":[4],"partitioning":[5,47,116],"criteria,":[6],"i.e,":[7],"the":[8,13,18,35,67,83,93,101,105,111,125,138,143,152,170,178,181],"flux":[9,14,28,36],"cut":[10,15,29,37,43,56,95],"A":[11,38,73,89],",":[12,17],"B":[16,30],"cost":[19,41,59],"ratio":[20,42,94],"cut,":[21],"and":[22,142],"one":[23],"generalized":[24,54],"minimum":[25,55,144],"cut.":[26],"is":[31,92,97,113],"an":[32,45],"extension":[33],"of":[34,66,69,104,110,160],".":[39],"generates":[44],"optimal":[46,171,182],"for":[48],"a":[49,58,63,167],"linear":[50,148,161],"placement":[51],"problem.":[52],"uses":[57],"function":[60,65,76],"related":[61,123],"to":[62,78,99,120,124,150,165,169],"polynomial":[64,75,189],"sizes":[68],"two":[70],"partitioned":[71,84],"subsets.":[72],"high\u2010order":[74],"tends":[77],"generate":[79],"partitions":[80],"such":[81],"that":[82,96],"subsets":[85],"equal":[86],"specified":[87],"sizes.":[88],"simplified":[90],"case":[91],"shown":[98,119],"derive":[100,166],"clustering":[102],"structure":[103],"network.":[106],"physical":[108],"meaning":[109],"cuts":[112],"described.":[114],"problems":[117],"are":[118,132,163],"be":[121,186],"strongly":[122],"communication":[126],"problems.":[127,156],"Several":[128],"network":[129],"flow":[130,140,155],"models":[131],"constructed.":[133],"We":[134,146],"illustrate":[135],"relations":[136],"between":[137],"maximum":[139,154],"solutions":[141,184],"partitionings.":[145],"use":[147],"programming":[149,162],"formulate":[151],"proposed":[153],"duality":[158],"techniques":[159],"utilized":[164],"relation":[168],"partition":[172,183],"solution.":[173],"Thus,":[174],"we":[175],"have":[176],"identified":[177],"cases":[179],"when":[180],"can":[185],"determined":[187],"in":[188],"time.":[190]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}