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

Mikko Koivisto, Petteri Laakkonen, Juho Lauri

Browse the full COCOON paper archive.