A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary (Q5146828)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7304080
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary |
scientific article; zbMATH DE number 7304080 |
Statements
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary (English)
0 references
2 February 2021
0 references
0.8815926909446716
0 references
0.8743091225624084
0 references
0.871741771697998
0 references
0.8596510291099548
0 references
0.8532233238220215
0 references
