P127: Enumeration of all minimal dominating sets in the line graph of a bipartite graph

P127: Enumeration of all minimal dominating sets in the line graph of a bipartite graph

Input:

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

Output:

All minimal dominating sets in $G$.

Complexity:

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

Comment:

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

Reference:

[Golovach2013a] (Bibtex)