P294: Enumeration of all forest extensions of a partially ordered set

P294: Enumeration of all forest extensions of a partially ordered set

Input:

A partially ordered set $P$.

Output:

All forest extensions of $P$.

Complexity:

$O(|E|^2)$ delay and $O(|E||R|)$ space.

Comment:

$E$ is the set of elements. $R$ is the binary relation on $E$.

Reference:

[Szwarcfiter2003b] (Bibtex)