P209: Enumeration of all triconnected rooted plane graphs

P209: Enumeration of all triconnected rooted plane graphs

Input:

An integer $n$.

Output:

All triconnected rooted plane graphs with $n$ vertices.

Complexity:

$O(n^3)$ delay with $O(n)$ space after $O(n)$ time preprocessing.

Comment:

Reference:

[Zhuang2010] (Bibtex)