P455: Enumerate all minimal dominating sets in a graph with bounded degeneracy.

P455: Enumerate all minimal dominating sets in a graph with bounded degeneracy.

Input:

A graph $G$ with bounded degeneracy.

Output:

All minimal dominating sets in $G$.

Complexity:

Polynomial delay.

Comment:

Reference:

[Kante2011] (Bibtex)