P460: Enumerate all minimal dominating sets in a cograph

P460: Enumerate all minimal dominating sets in a cograph

Input:

A cograph $G=(V, E)$.

Output:

All minimal dominating sets in $G$.

Complexity:

$O^*(15^{|V|/6})$ total time.

Comment:

There is a cograph with $O(15^{|V|/6})$ minimal dominating sets.

Reference:

[Couturier2013a] (Bibtex)