{"id":"https://openalex.org/W4417129614","doi":"https://doi.org/10.48550/arxiv.2510.09432","title":"On Stable Cutsets in General and Minimum Degree Constrained Graphs","display_name":"On Stable Cutsets in General and Minimum Degree Constrained Graphs","publication_year":2025,"publication_date":"2025-10-10","ids":{"openalex":"https://openalex.org/W4417129614","doi":"https://doi.org/10.48550/arxiv.2510.09432"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2510.09432","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2510.09432","pdf_url":"https://arxiv.org/pdf/2510.09432","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2510.09432","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120724704","display_name":"Mats Vroon","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Vroon, Mats","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5032730524","display_name":"Hans L. Bodlaender","orcid":"https://orcid.org/0000-0002-9297-3330"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bodlaender, Hans L.","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5120724704"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.6640999913215637,"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.6640999913215637,"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.2978000044822693,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.013399999588727951,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6187000274658203},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47870001196861267},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.4275999963283539},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4187000095844269},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.40369999408721924},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.34700000286102295},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3296999931335449},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.31929999589920044}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6931999921798706},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6498000025749207},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6187000274658203},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47870001196861267},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4316999912261963},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.4275999963283539},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4187000095844269},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.40369999408721924},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.34700000286102295},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3296999931335449},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.31929999589920044},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.2996000051498413},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.2892000079154968},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2874999940395355},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2815999984741211},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2705000042915344},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2615000009536743},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.2572000026702881},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.2556999921798706},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.2547999918460846}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2510.09432","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2510.09432","pdf_url":"https://arxiv.org/pdf/2510.09432","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2510.09432","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2510.09432","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2510.09432","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2510.09432","pdf_url":"https://arxiv.org/pdf/2510.09432","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0],"stable":[1,30,120],"cutset":[2,31],"is":[3,14,35,110,178],"a":[4,10,29,33,45,91,107,119,125,134],"set":[5],"of":[6,9,28,78,106,182],"vertices":[7],"$S$":[8],"connected":[11],"graph,":[12],"that":[13,101,148,171],"pairwise":[15],"non-adjacent":[16],"and":[17,57,70,133],"when":[18],"deleting":[19],"$S$,":[20],"the":[21,26,59,63,84,94,103,179,197,201],"graph":[22,34,55,108],"becomes":[23],"disconnected.":[24],"Determining":[25],"existence":[27],"in":[32,173],"known":[36],"to":[37,196,207],"be":[38,194],"NP-complete.":[39],"In":[40,80],"this":[41,169],"paper,":[42],"we":[43,72,82,99,123,146],"introduce":[44],"new":[46],"exact":[47,166,210],"algorithm":[48,61,127,137,167,191,211],"for":[49,62,88,128,138,153,168],"Stable":[50,85,149],"Cutset.":[51],"By":[52],"branching":[53],"on":[54,93],"configurations":[56],"using":[58],"$O^*(1.3645)$":[60],"(3,2)-Constraint":[64],"Satisfaction":[65],"Problem":[66],"presented":[67],"by":[68],"Beigel":[69],"Eppstein,":[71],"achieve":[73],"an":[74,165,208],"improved":[75,209],"running":[76],"time":[77],"$O^*(1.2972^n)$.":[79],"addition,":[81],"investigate":[83],"Cutset":[86,150],"problem":[87,170,199],"graphs":[89,129,139,154],"with":[90,155,200],"bound":[92],"minimum":[95,104,156,203],"degree":[96,105,157,204],"$\u03b4$.":[97],"First,":[98],"show":[100],"if":[102],"$G$":[109,115],"at":[111],"least":[112],"$\\frac{2}{3}(n-1)$,":[113],"then":[114],"does":[116],"not":[117],"contain":[118],"cutset.":[121],"Furthermore,":[122],"provide":[124],"polynomial-time":[126],"where":[130,140,159,176],"$\u03b4\\geq":[131],"\\tfrac{1}{2}n$,":[132],"similar":[135],"kernelisation":[136],"$\u03b4=":[141],"\\tfrac{1}{2}n":[142],"-":[143,185],"k$.":[144],"Finally,":[145],"prove":[147],"remains":[151],"NP-complete":[152],"$c$,":[158],"$c":[160],">":[161],"1$.":[162],"We":[163],"design":[164],"runs":[172],"$O^*(\u03bb^n)$":[174],"time,":[175],"$\u03bb$":[177],"positive":[180],"root":[181],"$x^{\u03b4+":[183],"2}":[184],"x^{\u03b4+":[186],"1}":[187],"+":[188],"6$.":[189],"This":[190],"can":[192],"also":[193],"applied":[195],"\\textsc{3-Colouring}":[198],"same":[202],"constraint,":[205],"leading":[206],"as":[212],"well.":[213]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-14T00:00:00"}