Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs

From MaRDI portal

Publication:6538673

Jump to:navigation, search

DOI10.1137/1.9781611977554.ch140MaRDI QIDQ6538673

Daniel Neuen, Philip Wellnitz, Philipp Schepper, Dániel Marx, Jacob Focke, Govind S. Sankar, Fionn Mc Inerney

Publication date: 14 May 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6538673&oldid=40063462"