P461: Enumerate all minimal dominating sets in a trivially perfect graph.

P461: Enumerate all minimal dominating sets in a trivially perfect graph.

Input:

Trivially perfect graph $G = (V, E)$.

Output:

All minimal dominating sets in $G$.

Complexity:

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

Comment:

There is a trivially perfect graphs with $3^{|V|/3}$ minimal dominating sets

Reference:

[Couturier2013a] (Bibtex)