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

Mikko Koivisto, Petteri Laakkonen, Juho Lauri (2017)

Details and statistics

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

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-02

a service of  Schloss Dagstuhl - Leibniz Center for Informatics