P203: Enumeration of all minimal dominating sets in a path graph or $(C_4, C_5, craw)$-free graph

P203: Enumeration of all minimal dominating sets in a path graph or $(C_4, C_5, craw)$-free graph

Input:

A line graph or $(C_4, C_5, craw)$-free graph $G$.

Output:

All minimal dominating sets in $G$.

Complexity:

$O(||G||^2N^3)$ total time.

Comment:

$||G||$ is the size of $G$ and $N$ is the number of minimal dominating sets in $G$.

Reference:

[Kante2012] (Bibtex)