P456: Enumerate all minimal dominating sets in a split graph

P456: Enumerate all minimal dominating sets in a split graph

Input:

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

Output:

All minimal dominating sets in $G$.

Complexity:

$O(|V| + |E|)$ delay with $O(|V|^2)$ space.

Comment:

Reference:

[Kante2011] (Bibtex)