P463: Enumerate all minimal dominating sets in a chain graph.

P463: Enumerate all minimal dominating sets in a chain graph.

Input:

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

Output:

All minimal dominating sets in $G$.

Complexity:

$O(|V||E|)$ total time.

Comment:

Reference:

[Couturier2013a] (Bibtex)