{"id":"https://openalex.org/W1971758446","doi":"https://doi.org/10.1137/s1064827593255135","title":"How Good is Recursive Bisection?","display_name":"How Good is Recursive Bisection?","publication_year":1997,"publication_date":"1997-09-01","ids":{"openalex":"https://openalex.org/W1971758446","doi":"https://doi.org/10.1137/s1064827593255135","mag":"1971758446"},"language":"en","primary_location":{"id":"doi:10.1137/s1064827593255135","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1064827593255135","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"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 Scientific 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/A5066426676","display_name":"Horst D. Simon","orcid":"https://orcid.org/0000-0003-0832-3720"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Horst D. Simon","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5102005063","display_name":"Shang\u2010Hua Teng","orcid":"https://orcid.org/0000-0001-5011-4514"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shang-Hua Teng","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5066426676"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":15.7284,"has_fulltext":false,"cited_by_count":223,"citation_normalized_percentile":{"value":0.99046222,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"18","issue":"5","first_page":"1436","last_page":"1445"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9995999932289124,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9995999932289124,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9994999766349792,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9954000115394592,"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/bisection-method","display_name":"Bisection method","score":0.7407988905906677},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7127619981765747},{"id":"https://openalex.org/keywords/bisection","display_name":"Bisection","score":0.6879394054412842},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.677668571472168},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6441805362701416},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.582044243812561},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.5678713321685791},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5333912968635559},{"id":"https://openalex.org/keywords/polygon-mesh","display_name":"Polygon mesh","score":0.46857190132141113},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39157065749168396},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3894971013069153},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3515975773334503},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.28902000188827515},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06810808181762695}],"concepts":[{"id":"https://openalex.org/C157544257","wikidata":"https://www.wikidata.org/wiki/Q866300","display_name":"Bisection method","level":2,"score":0.7407988905906677},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7127619981765747},{"id":"https://openalex.org/C31599958","wikidata":"https://www.wikidata.org/wiki/Q3128632","display_name":"Bisection","level":2,"score":0.6879394054412842},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.677668571472168},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6441805362701416},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.582044243812561},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.5678713321685791},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5333912968635559},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.46857190132141113},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39157065749168396},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3894971013069153},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3515975773334503},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28902000188827515},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06810808181762695},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s1064827593255135","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1064827593255135","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"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 Scientific Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.40.4680","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.4680","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-sal.cs.uiuc.edu/~steng/horst.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W107408007","https://openalex.org/W1909076809","https://openalex.org/W1966461475","https://openalex.org/W1979036815","https://openalex.org/W1981885118","https://openalex.org/W1981893977","https://openalex.org/W2011039300","https://openalex.org/W2034679498","https://openalex.org/W2038643780","https://openalex.org/W2041503325","https://openalex.org/W2044355921","https://openalex.org/W2051588145","https://openalex.org/W2066775922","https://openalex.org/W2072535053","https://openalex.org/W2073558110","https://openalex.org/W2073890622","https://openalex.org/W2077571023","https://openalex.org/W2090129250","https://openalex.org/W2091104536","https://openalex.org/W2096159022","https://openalex.org/W2106978190","https://openalex.org/W2111516947","https://openalex.org/W2113679823","https://openalex.org/W2114030927","https://openalex.org/W2120018535","https://openalex.org/W2125278290","https://openalex.org/W2137541800","https://openalex.org/W2155754954","https://openalex.org/W3014033153"],"related_works":["https://openalex.org/W2329494729","https://openalex.org/W41290553","https://openalex.org/W3112697985","https://openalex.org/W1986919722","https://openalex.org/W2585516632","https://openalex.org/W2093663313","https://openalex.org/W4296983618","https://openalex.org/W2139577760","https://openalex.org/W1518606313","https://openalex.org/W3118962767"],"abstract_inverted_index":{"The":[0],"most":[1],"commonly":[2],"used":[3],"p-way":[4,112,182,206,222],"partitioning":[5],"method":[6],"is":[7,65,107,115,126,155,174,184,190,210],"recursive":[8],"bisection":[9,26,43,48,79,91,105],"(RB).":[10],"It":[11],"first":[12,132],"divides":[13,31],"a":[14,17,24,52,111,157,199],"graph":[15,53],"or":[16],"mesh":[18],"into":[19,54],"two":[20,33,55,129],"equal-sized":[21,56],"pieces,":[22],"by":[23,128,186],"\"good\"":[25],"algorithm,":[27],"and":[28,151],"then":[29,198],"recursively":[30],"the":[32,46,60,88,98,120,161,171,181,191,196,217,220],"pieces.":[34],"Ideally,":[35],"we":[36,133,167],"would":[37],"like":[38],"to":[39,58,86],"use":[40,70],"an":[41,77,103,203,212],"optimal":[42,47,78,104,121,162,221],"algorithm.":[44,80],"Because":[45],"problem":[49],"that":[50,97,114,135,142,169,177],"partitions":[51],"subgraphs":[57],"minimize":[59],"number":[61,192],"of":[62,76,140,160,193,195,216,219],"edges":[63],"cut":[64],"NP-complete,":[66],"practical":[67,145],"RB":[68,99,154,201],"algorithms":[69],"more":[71],"efficient":[72],"heuristics":[73,83],"in":[74,144,180],"place":[75],"Most":[81],"such":[82,147],"are":[84],"designed":[85],"find":[87],"best":[89],"possible":[90],"within":[92,156,211],"allowed":[93],"time.":[94],"We":[95],"show":[96,134,168],"method,":[100],"even":[101],"when":[102],"algorithm":[106],"assumed,":[108],"may":[109],"produce":[110],"partition":[113,183,207],"very":[116],"far":[117],"way":[118],"from":[119],"one.":[122],"Our":[123],"negative":[124],"result":[125],"complemented":[127],"positive":[130],"ones:":[131],"for":[136],"some":[137],"important":[138],"classes":[139],"graphs":[141],"occur":[143],"applications,":[146],"as":[148],"well-shaped":[149],"finite-element":[150],"finite-difference":[152],"meshes,":[153],"constant":[158],"factor":[159,215],"one":[163],"\"almost":[164],"always.\"":[165],"Second,":[166],"if":[170],"balance":[172],"condition":[173],"relaxed":[175],"so":[176],"each":[178],"block":[179],"bounded":[185],"2n/p,":[187],"where":[188],"n":[189],"vertices":[194],"graph,":[197],"modified":[200],"finds":[202],"approximately":[204],"balanced":[205],"whose":[208],"cost":[209,218],"O(log":[213],"p)":[214],"partition.":[223]},"counts_by_year":[{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":17},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":12}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}