P458: Enumerate all minimal dominating sets in a split graph.

P458: Enumerate all minimal dominating sets in a split graph.
Input:
A split graph $G = (V, E)$.
Output:
All minimal dominating set in $G$.
Complexity:
$O(1.4656^{|V|})$ total time.
Comment:
Reference:
[Couturier2013a] (Bibtex)