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

Saved in:

Bibliographic Details
Title:	Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs—Part I: Algorithmic Results.
Authors:	Focke, Jacob¹, jacob.focke@cispa.de, Marx, Dániel¹, marx@cispa.de, Mc Inerney, Fionn², fionn.mc.inerney@tuwien.ac.at, Neuen, Daniel³, dneuen@mpi-inf.mpg.de, Sankar, Govind S.⁴, govind.subash.sankar@duke.edu, Schepper, Philipp¹, philipp.schepper@cispa.de, Wellnitz, Philip⁵, wellnitz@nii.ac.jp
Source:	ACM Transactions on Algorithms; Jul2025, Vol. 21 Issue 3, p1-45, 45p
Database:	Applied Science & Technology Source

Description
ISSN:	15496325
DOI:	10.1145/3731452