P454: Enumerate all minimal dominating sets in a strongly chordal graph.

P454: Enumerate all minimal dominating sets in a strongly chordal graph.

Input:

A strongly chordal graph $G$.

Output:

All minimal dominating sets in $G$.

Complexity:

Polynomial delay.

Comment:

Reference:

[Kante2011] (Bibtex)