{"id":"https://openalex.org/W4307592276","doi":"https://doi.org/10.1145/3570162","title":"Minimum Cut and Minimum <i>k</i> -Cut in Hypergraphs via Branching Contractions","display_name":"Minimum Cut and Minimum <i>k</i> -Cut in Hypergraphs via Branching Contractions","publication_year":2022,"publication_date":"2022-10-29","ids":{"openalex":"https://openalex.org/W4307592276","doi":"https://doi.org/10.1145/3570162"},"language":"en","primary_location":{"id":"doi:10.1145/3570162","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3570162","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5013518909","display_name":"Kyle Fox","orcid":"https://orcid.org/0000-0002-2446-8594"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kyle Fox","raw_affiliation_strings":["The University of Texas at Dallas, Dallas, USA"],"raw_orcid":"https://orcid.org/0000-0002-2446-8594","affiliations":[{"raw_affiliation_string":"The University of Texas at Dallas, Dallas, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087182068","display_name":"Debmalya Panigrahi","orcid":"https://orcid.org/0000-0003-1799-6660"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Debmalya Panigrahi","raw_affiliation_strings":["Duke University, Durham, USA"],"raw_orcid":"https://orcid.org/0000-0003-1799-6660","affiliations":[{"raw_affiliation_string":"Duke University, Durham, USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103077529","display_name":"Fred Zhang","orcid":"https://orcid.org/0000-0001-7256-9843"},"institutions":[{"id":"https://openalex.org/I134446601","display_name":"Berkeley College","ror":"https://ror.org/02xewxa75","country_code":"US","type":"education","lineage":["https://openalex.org/I134446601"]},{"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":"Fred Zhang","raw_affiliation_strings":["UC Berkeley, Berkeley, USA"],"raw_orcid":"https://orcid.org/0000-0001-7256-9843","affiliations":[{"raw_affiliation_string":"UC Berkeley, Berkeley, USA","institution_ids":["https://openalex.org/I134446601","https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5013518909"],"corresponding_institution_ids":["https://openalex.org/I162577319"],"apc_list":null,"apc_paid":null,"fwci":0.6034,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.71232229,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":"19","issue":"2","first_page":"1","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.7780301570892334},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7724528908729553},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.768364429473877},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6602990627288818},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.49481743574142456},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.43900737166404724},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.4361419081687927},{"id":"https://openalex.org/keywords/cut-off","display_name":"Cut-off","score":0.4310973882675171},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38177403807640076},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.16219693422317505},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07857337594032288}],"concepts":[{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.7780301570892334},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7724528908729553},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.768364429473877},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6602990627288818},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.49481743574142456},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.43900737166404724},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.4361419081687927},{"id":"https://openalex.org/C2778462145","wikidata":"https://www.wikidata.org/wiki/Q5196598","display_name":"Cut-off","level":3,"score":0.4310973882675171},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38177403807640076},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.16219693422317505},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07857337594032288},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3570162","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3570162","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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":18,"referenced_works":["https://openalex.org/W95318493","https://openalex.org/W1549414783","https://openalex.org/W1572441411","https://openalex.org/W1964510837","https://openalex.org/W1974139762","https://openalex.org/W1995027289","https://openalex.org/W1996575062","https://openalex.org/W2035228443","https://openalex.org/W2043525538","https://openalex.org/W2057463094","https://openalex.org/W2072027869","https://openalex.org/W2168919539","https://openalex.org/W3034552259","https://openalex.org/W3096070013","https://openalex.org/W3100115795","https://openalex.org/W4255005259","https://openalex.org/W4316652496","https://openalex.org/W4389615669"],"related_works":["https://openalex.org/W2142835653","https://openalex.org/W2942946217","https://openalex.org/W2903538031","https://openalex.org/W4307592276","https://openalex.org/W1572441411","https://openalex.org/W2478657554","https://openalex.org/W2115772827","https://openalex.org/W1967536438","https://openalex.org/W1981202693","https://openalex.org/W2129497110"],"abstract_inverted_index":{"On":[0],"hypergraphs":[1,38,79],"with":[2,123],"m":[3],"hyperedges":[4],"and":[5,98,148,157,167],"n":[6],"vertices,":[7],"where":[8],"p":[9],"denotes":[10],"the":[11,15,19,45,51,88,95,143,162],"total":[12],"size":[13],"of":[14,39,80,107,132,146,164],"hyperedges,":[16],"we":[17],"provide":[18],"following":[20],"results:":[21],"We":[22,60],"give":[23,61],"an":[24,62],"algorithm":[25,43,63,86],"that":[26,64],"runs":[27,65],"in":[28,37,66,78,153],"\\(\\widetilde{O}(mn^{2k-2})\\)":[29],"time":[30,49,71],"for":[31,50,56,72,93,103],"finding":[32,73],"a":[33,74,116,133],"minimum":[34,52,75,96,99,117,121,165,168],"k":[35,53,57,76,100,118,170],"-cut":[36,54,77,101,119,171],"arbitrary":[40],"rank.":[41],"This":[42,85],"betters":[44,87],"previous":[46,89],"best":[47,90],"running":[48,91],"problem,":[55],"&gt;":[58],"2.":[59],"\\(\\widetilde{O}(n^{\\max":[67],"\\lbrace":[68],"r,2k-2\\rbrace":[69],"})\\)":[70],"constant":[81],"rank":[82],"r":[83],".":[84],"times":[92],"both":[94],"cut":[97],"problems":[102,163],"dense":[104],"hypergraphs.":[105,176],"Both":[106],"our":[108],"algorithms":[109,127],"are":[110,128],"Monte":[111],"Carlo,":[112],"i.e.,":[113],"they":[114],"return":[115],"(or":[120],"cut)":[122],"high":[124],"probability.":[125],"These":[126],"obtained":[129],"as":[130],"instantiations":[131],"generic":[134],"branching":[135],"randomized":[136],"contraction":[137],"technique":[138],"on":[139,150,172],"hypergraphs,":[140],"which":[141,174],"extends":[142],"celebrated":[144],"work":[145],"Karger":[147],"Stein":[149],"recursive":[151],"contractions":[152],"graphs.":[154],"Our":[155],"techniques":[156],"results":[158],"also":[159],"extend":[160],"to":[161],"hedge-cut":[166],"hedge-":[169],"hedgegraphs,":[173],"generalize":[175]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}