List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs (Q7253095)
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 8203250
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs |
scientific article; zbMATH DE number 8203250 |
Statements
List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs (English)
0 references
26 May 2026
0 references
graph homomorphism
0 references
list homomorphism
0 references
vertex deletion
0 references
edge deletion
0 references
multiway cut
0 references
parameterized complexity
0 references
tight bounds
0 references
treewidth
0 references
SETH
0 references
0 references
0 references
0 references
