Showing cs.CCShow all
2 papers · 1 filter
cs.CC2006
An Improved Exact Algorithm for the Domatic Number Problem
Tobias Riege, Jörg Rothe, Holger Spakowski +1
The 3-domatic number problem asks whether a given graph can be partitioned intothree dominating sets. We prove that this problem can be solved by a deterministic algorithm in time…
cs.CC2005
An Exact 2.9416^n Algorithm for the Three Domatic Number Problem
Tobias Riege, Jörg Rothe
The three domatic number problem asks whether a given undirected graph can be partitioned into at least three dominating sets, i.e., sets whose closed neighborhood equals the verte…