"NP-completeness Results for Partitioning a Graph into Total Dominating Sets."

Mikko Koivisto, Petteri Laakkonen, Juho Lauri (2017)

> Home

Details and statistics

DOI: 10.1007/978-3-319-62389-4_28

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cocoon/KoivistoLL17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/KoivistoLL17
Mikko Koivisto, Petteri Laakkonen, Juho Lauri:
NP-completeness Results for Partitioning a Graph into Total Dominating Sets. COCOON 2017: 333-345

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.