P208: Enumeration of all triconnected rooted plane graphs

P208: Enumeration of all triconnected rooted plane graphs

Input:

Integers $n$ and $g$.

Output:

All triconnected rooted plane graphs with $n$ vertices, whose each inner face has the length at most $g$.

Complexity:

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

Comment:

Reference:

[Zhuang2010] (Bibtex)