Fundamental problems on bounded-treewidth graphs: the real source of hardness (Q6875174)
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 8144496
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fundamental problems on bounded-treewidth graphs: the real source of hardness |
scientific article; zbMATH DE number 8144496 |
Statements
Fundamental problems on bounded-treewidth graphs: the real source of hardness (English)
0 references
14 January 2026
0 references
parameterized complexity
0 references
tight bounds
0 references
hub
0 references
treewidth
0 references
strong exponential time hypothesis
0 references
vertex coloring
0 references
vertex deletion
0 references
edge deletion
0 references
triangle packing
0 references
triangle partition
0 references
set cover hypothesis
0 references
dominating set
0 references
0 references
0 references
0 references
