P347: Enumeration of all minimal dominating sets in a $P_6$-free chordal graph

P347: Enumeration of all minimal dominating sets in a $P_6$-free chordal graph

Input:

A $P_6$-free chordal graph $G = (V, E)$.

Output:

All minimal dominating sets in $G$.

Complexity:

Linear delay with $O(|V|^2)$ space.

Comment:

Reference:

[Kante2014] (Bibtex)