List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Esmer, Barış Can, Focke, Jacob, Marx, Dániel, Rzążewski, Paweł
Format:	Preprint
Published:	2022
Subjects:	Computational Complexity Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2210.10677