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

Jacob Focke et al. (2023)

> Home

Details and statistics

DOI: 10.1137/1.9781611977554.CH140

access: closed

type: Conference or Workshop Paper

metadata version: 2023-02-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/soda/FockeMINSSW23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/FockeMINSSW23
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. SODA 2023: 3664-3683

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.