"Tight Complexity Bounds for Counting Generalized Dominating Sets in ..."

Jacob Focke et al. (2025)

> Home

Details and statistics

DOI: 10.1145/3731452

access: closed

type: Journal Article

metadata version: 2025-09-11

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/FockeMINSSW25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/FockeMINSSW25
Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz:
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs - Part I: Algorithmic Results. ACM Trans. Algorithms 21(3): 27:1-27:45 (2025)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.