"NP-completeness results for partitioning a graph into total dominating sets."

Mikko Koivisto, Petteri Laakkonen, Juho Lauri (2020)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2018.04.006

access: closed

type: Journal Article

metadata version: 2021-04-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/KoivistoLL20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/KoivistoLL20
Mikko Koivisto, Petteri Laakkonen, Juho Lauri:
NP-completeness results for partitioning a graph into total dominating sets. Theor. Comput. Sci. 818: 22-31 (2020)

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.