5-approximation for \(\mathcal{H}\)-treewidth essentially as fast as \(\mathcal{H}\)-deletion parameterized by solution size (Q6657028)
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 7961911
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 5-approximation for \(\mathcal{H}\)-treewidth essentially as fast as \(\mathcal{H}\)-deletion parameterized by solution size |
scientific article; zbMATH DE number 7961911 |
Statements
5-approximation for \(\mathcal{H}\)-treewidth essentially as fast as \(\mathcal{H}\)-deletion parameterized by solution size (English)
0 references
6 January 2025
0 references
fixed-parameter tractability
0 references
treewidth
0 references
graph decompositions
0 references
