{"id":"https://openalex.org/W2065982392","doi":"https://doi.org/10.1002/(sici)1097-0037(199612)28:4<221::aid-net6>3.0.co;2-n","title":"The bottleneck graph partition problem","display_name":"The bottleneck graph partition problem","publication_year":1996,"publication_date":"1996-12-01","ids":{"openalex":"https://openalex.org/W2065982392","doi":"https://doi.org/10.1002/(sici)1097-0037(199612)28:4<221::aid-net6>3.0.co;2-n","mag":"2065982392"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0037(199612)28:4<221::aid-net6>3.0.co;2-n","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199612)28:4<221::aid-net6>3.0.co;2-n","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/A5085640376","display_name":"Dorit S. Hochbaum","orcid":"https://orcid.org/0000-0002-2498-0512"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dorit S. Hochbaum","raw_affiliation_strings":["Department of Industrial Engineering and Operations Research and Walter A. Haas School of Business, University of California, Berkeley, Berkeley, California 94720-1777","Department of Industrial Engineering and Operations Research and Walter A. Haas School of Business, University of California, Berkeley, Berkeley, California 94720\u20101777"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research and Walter A. Haas School of Business, University of California, Berkeley, Berkeley, California 94720-1777","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research and Walter A. Haas School of Business, University of California, Berkeley, Berkeley, California 94720\u20101777","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067584837","display_name":"Anu Pathria","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anu Pathria","raw_affiliation_strings":["Department of Industrial Engineering and Operations Research, University of California, Berkeley, Berkeley, California 94720"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research, University of California, Berkeley, Berkeley, California 94720","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5085640376"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.0117,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.76170132,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"28","issue":"4","first_page":"221","last_page":"225"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9922999739646912,"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.9922999739646912,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.983299970626831,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9591000080108643,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/bottleneck","display_name":"Bottleneck","score":0.8334797620773315},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7308911085128784},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6746419072151184},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.5980382561683655},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5764802694320679},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5284181833267212},{"id":"https://openalex.org/keywords/frequency-partition-of-a-graph","display_name":"Frequency partition of a graph","score":0.5026726722717285},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4830670952796936},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47771263122558594},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42126673460006714},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30748188495635986},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.29124462604522705},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.22871237993240356}],"concepts":[{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.8334797620773315},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7308911085128784},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6746419072151184},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.5980382561683655},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5764802694320679},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5284181833267212},{"id":"https://openalex.org/C178744013","wikidata":"https://www.wikidata.org/wiki/Q5502876","display_name":"Frequency partition of a graph","level":5,"score":0.5026726722717285},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4830670952796936},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47771263122558594},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42126673460006714},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30748188495635986},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.29124462604522705},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.22871237993240356},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/(sici)1097-0037(199612)28:4<221::aid-net6>3.0.co;2-n","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199612)28:4<221::aid-net6>3.0.co;2-n","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":0,"referenced_works":[],"related_works":["https://openalex.org/W3139829055","https://openalex.org/W1982865350","https://openalex.org/W3183075326","https://openalex.org/W1598028160","https://openalex.org/W4300494273","https://openalex.org/W2615015219","https://openalex.org/W2753620285","https://openalex.org/W3012931947","https://openalex.org/W2583811263","https://openalex.org/W2035944803"],"abstract_inverted_index":{"The":[0],"bottleneck":[1,55,69,104],"graph":[2,12,35,70],"partition":[3,7,36,71],"problem":[4,106],"is":[5,31,48,52,57,75],"to":[6,49,90,102],"the":[8,20,25,28,34,39,42,46,54,68,76,81,103],"nodes":[9,79],"of":[10,41,78],"a":[11],"into":[13],"two":[14,29,86],"equally":[15],"sized":[16],"sets,":[17],"so":[18],"that":[19],"maximum":[21],"edge":[22,43],"weight":[23],"in":[24,45,80],"cut":[26,47],"separating":[27],"sets":[30],"minimum.":[32],"Whereas":[33],"problem,":[37,72],"where":[38,73],"sum":[40],"weights":[44],"be":[50],"minimized,":[51],"NP-hard,":[53],"version":[56],"polynomial.":[58],"This":[59],"paper":[60],"describes":[61],"an":[62],"O(n2":[63],"log":[64],"n)":[65],"algorithm":[66],"for":[67],"n":[74],"number":[77],"graph.":[82],"We":[83,93],"point":[84],"out":[85],"interesting":[87],"issues":[88],"related":[89],"dynamic":[91],"algorithms.":[92],"also":[94],"generalize":[95],"our":[96],"polynomiality":[97],"result":[98],"(for":[99],"fixed":[100],"k)":[101],"k-cut":[105],"with":[107],"specified":[108],"vertices":[109],"and":[110],"bounded":[111],"components.":[112],"\u00a9":[113],"1996":[114],"John":[115],"Wiley":[116],"&":[117],"Sons,":[118],"Inc.":[119]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}