P424: Enumeration of all minimal dominating sets in a chordal bipartite graph
P424: Enumeration of all minimal dominating sets in a chordal bipartite graph
Input:
A chordal bipartite graph $G$.
Output:
All minimal dominating sets in $G$.
Complexity:
$O(n^3m|\mathcal{L}|^2)$ delay and the total running time is $O(n^3m|\mathcal{L}^*|^2)$.
Comment:
$n$ is the number vertices in $G$,
$m$ is the number of edges in $G$,
$\mathcal{L}$ is the family of already generated minimal dominating sets, and
$\mathcal{L}^*$ is the family of all minimal dominating sets.