P346: Enumeration of all CA-sets of a directed graph

P346: Enumeration of all CA-sets of a directed graph

Input:

A directed graph $G = (V, E)$.

Output:

All CA-sets of $G$.

Complexity:

$O(|V|^{2.49+} + \gamma)$.

Comment:

$\gamma$ is the output size. $S \subset V$ is a \textit{CA-set} if, for each $v \in S$, all ancestor of $v$ belongs to $S$.

Reference:

[Kashiwabara1992] (Bibtex)