P125: Enumeration of all minimal dominating sets in a line graph

P125: Enumeration of all minimal dominating sets in a line graph

Input:

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

Output:

All minimal dominating sets in $G$.

Complexity:

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

Comment:

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

Reference:

[Golovach2013a] (Bibtex)