P165: Enumeration of all series-parallel graphs with at most $m$ edges

P165: Enumeration of all series-parallel graphs with at most $m$ edges

Input:

An integer $m$.

Output:

All series-parallel graphs with at most $m$ edges.

Complexity:

$O(m)$ time per graph.

Comment:

Reference:

[Kawano2005a] (Bibtex)