P457: Enumerate all minimal dominating sets in a chordal graph.

P457: Enumerate all minimal dominating sets in a chordal graph.

Input:

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

Output:

All minimal dominating sets in $G$.

Complexity:

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

Comment:

Reference:

[Couturier2013a] (Bibtex)