P18: Enumeration of all plane graphs

P18: Enumeration of all plane graphs

Input:

$m$: the maximum number of edges.

Output:

All connected non-rooted plane graphs with at most $m$ edges.

Complexity:

$O(m^3)$ time per graph with $O(m)$ space.

Comment:

This algorithm does not outputs the entire graph but the difference from previous one.

Reference:

[Yamanaka2009] (Bibtex)