P240: Enumeration of all minimal dominating sets in a graph

P240: Enumeration of all minimal dominating sets in a graph

Input:

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

Output:

All minimal dominating sets in $G$.

Complexity:

$O(1.7159^{|V|})$ total time.

Comment:

Reference:

[Fomin2008] (Bibtex)