{"id":"https://openalex.org/W7131659397","doi":"https://doi.org/10.48550/arxiv.2602.21859","title":"Steiner Forest for $H$-Subgraph-Free Graphs","display_name":"Steiner Forest for $H$-Subgraph-Free Graphs","publication_year":2026,"publication_date":"2026-02-25","ids":{"openalex":"https://openalex.org/W7131659397","doi":"https://doi.org/10.48550/arxiv.2602.21859"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.21859","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5094063465","display_name":"Tala Eagling-Vose","orcid":"https://orcid.org/0009-0008-0346-7032"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Eagling-Vose, Tala","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086433219","display_name":"David C. Kutner","orcid":"https://orcid.org/0000-0003-2979-4513"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kutner, David C.","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126871624","display_name":"Felicia Lucke","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lucke, Felicia","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126893614","display_name":"D\u00e1niel Marx","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marx, D\u00e1niel","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126945931","display_name":"Barnaby Martin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Martin, Barnaby","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126914906","display_name":"Dani\u00ebl Paulusma","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Paulusma, Dani\u00ebl","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"van Leeuwen, Erik Jan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"van Leeuwen, Erik Jan","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5094063465"],"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.8873999714851379,"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.8873999714851379,"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.08169999718666077,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.007300000172108412,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.829800009727478},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6525999903678894},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.6291000247001648},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.4837999939918518},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4474000036716461},{"id":"https://openalex.org/keywords/connected-component","display_name":"Connected component","score":0.4180999994277954},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.39320001006126404},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3873000144958496}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8341000080108643},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.829800009727478},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7476999759674072},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6525999903678894},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6291000247001648},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5159000158309937},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.4837999939918518},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4474000036716461},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.4180999994277954},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.39320001006126404},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3873000144958496},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.361299991607666},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.32499998807907104},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3212999999523163},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.30300000309944153},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.29350000619888306},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.28760001063346863},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.28610000014305115},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.2741999924182892},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.25760000944137573},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.25619998574256897}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.21859","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.21859","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.21859","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.21859","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"display_name":"Life in Land","score":0.6336791515350342,"id":"https://metadata.un.org/sdg/15"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Our":[0],"main":[1],"result":[2,224],"is":[3,95,148,183,264,286],"a":[4,65,104,117,152,175,184,187,194,209,226,242],"full":[5],"classification,":[6],"for":[7,137,212,237,244],"every":[8,158],"connected":[9,76,96,115],"graph":[10,210],"$H$,":[11],"of":[12,16,42,68,70,79,91,107,109,122,151,160,199,215],"the":[13,28,61,149,171,200,231,235],"computational":[14],"complexity":[15],"Steiner":[17,51,133,216,262],"Forest":[18,52,134,217,263],"on":[19],"$H$-subgraph-free":[20],"graphs.":[21],"To":[22,169],"obtain":[23],"this":[24],"dichotomy,":[25,172],"we":[26,173,240],"establish":[27,170,241],"following":[29,62],"new":[30,40,222],"algorithmic,":[31],"hardness,":[32],"and":[33,270,276,283,285],"combinatorial":[34],"results:":[35,129,168],"Algorithms:":[36],"We":[37,130],"identify":[38],"two":[39,201],"classes":[41],"graph-theoretical":[43],"structures":[44,204],"that":[45,73,94,112,132,157,180,261],"make":[46],"it":[47],"possible":[48],"to":[49,97,233],"solve":[50],"in":[53,99,116],"polynomial":[54],"time.":[55],"Roughly":[56],"speaking,":[57],"our":[58,221,254],"algorithms":[59],"handle":[60],"cases:":[63],"(1)":[64,268],"set":[66,90,105,141,146,248],"$X$":[67,98,106],"vertices":[69,108],"bounded":[71,83,126],"size":[72,93,111,150],"are":[74,113],"pairwise":[75,114],"by":[77,120],"subgraphs":[78,121],"treewidth":[80,123],"$2$":[81,124],"or":[82,125,186,207,225,273,279],"size,":[84],"possibly":[85],"together":[86,256],"with":[87,139,246,257],"an":[88,100],"independent":[89],"arbitrary":[92,101,110],"way;":[102],"(2)":[103,274],"cyclic":[118],"manner":[119],"size.":[127],"Hardness":[128],"show":[131,260],"remains":[135],"NP-complete":[136,287],"graphs":[138,245],"2-deletion":[140],"number":[142,147,249],"$3$.":[143],"(The":[144],"$c$-deletion":[145,247],"smallest":[153],"cutset":[154],"$S$":[155],"such":[156],"component":[159],"$G-S$":[161],"has":[162],"at":[163,250],"most":[164,251],"$c$":[165],"vertices.)":[166],"Combinatorial":[167],"perform":[174],"delicate":[176],"graph-theoretic":[177],"analysis":[178],"showing":[179],"if":[181,267],"$H$":[182,192],"path":[185],"subdivided":[188],"claw,":[189],"then":[190],"excluding":[191],"as":[193],"subgraph":[195],"either":[196,220],"yields":[197,208],"one":[198],"algorithmically":[202],"favourable":[203],"described":[205],"above,":[206],"class":[211],"which":[213],"NP-completeness":[214],"follows":[218],"from":[219],"hardness":[223,236],"previously":[227],"known":[228],"one.":[229],"Along":[230],"way":[232],"classifying":[234],"excluded":[238],"subgraphs,":[239],"dichotomy":[243],"$k$.":[252],"Specifically,":[253],"results":[255],"pre-existing":[258],"ones":[259],"polynomial-time":[265],"solvable":[266],"$c=1$":[269],"$k\\geq":[271],"0$,":[272],"$c=2$":[275],"$k\\leq":[277],"2$,":[278],"(3)":[280],"$c\\geq":[281],"3$":[282],"$k=1$,":[284],"otherwise.":[288]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-27T00:00:00"}