P249: Enumeration of all non-crossing spanning connected graphs on a given point set in the plane

P249: Enumeration of all non-crossing spanning connected graphs on a given point set in the plane

Input:

A fixed point set $P$.

Output:

All non-crossing spanning connected graphs on $P$.

Complexity:

$O(N)$ total time.

Comment:

$N$ is the number of solutions.

Reference:

[Katoh2009a] (Bibtex)