P35: Enumeration of all minimal dominating sets in an undirected permutation graph

P35: Enumeration of all minimal dominating sets in an undirected permutation graph

Input:

An undirected permutation graph $G=(V, E)$.

Output:

All minimal dominating sets.

Complexity:

$O(|V|)$ delay with $O(|V|^8)$ pre-processing.

Comment:

Reference:

[Kante2013] (Bibtex)