P128: Enumeration of all minimal dominating sets in a graph of girth at least 7

P128: Enumeration of all minimal dominating sets in a graph of girth at least 7

Input:

A graph $G = (V, E)$ of girth at least 7.

Output:

All minimal dominating sets in $G$.

Complexity:

$O(|V|^2|E||\mathcal{L}|^2)$ delay.

Comment:

$\mathcal{L}$ is the set of already generated solutions.

Reference:

[Golovach2013a] (Bibtex)