English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs

MPS-Authors
/persons/resource/persons229250

Wellnitz,  Philip       
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Focke, J., Marx, D., Inerney, F. M., Neuen, D., Sankar, G. S., Schepper, P., et al. (2023). Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. In N. Bansal, & V. Nagarajan (Eds.), Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 3664-3683). Philadelphia, PA: SIAM. doi:10.1137/1.9781611977554.ch140.


Cite as: https://hdl.handle.net/21.11116/0000-000C-1EA4-A
Abstract
There is no abstract available