P126: Enumeration of all minimal edge dominating sets in a bipartite graph

P126: Enumeration of all minimal edge dominating sets in a bipartite graph

Input:

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

Output:

All minimal edge dominating sets in $G$.

Complexity:

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

Comment:

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

Reference:

[Golovach2013a] (Bibtex)