Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Focke, Jacob, Marx, Dániel, Inerney, Fionn Mc, Neuen, Daniel, Sankar, Govind S., Schepper, Philipp, Wellnitz, Philip
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/2211.04278