P36: Enumeration of all minimal dominating sets in an undirected interval graph

P36: Enumeration of all minimal dominating sets in an undirected interval graph

Input:

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

Output:

All minimal dominating sets.

Complexity:

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

Comment:

Reference:

[Kante2013] (Bibtex)