P295: Enumeration of all non-isomorphic chord diagrams

P295: Enumeration of all non-isomorphic chord diagrams

Input:

An integer $2n$.

Output:

All non-isomorphic chord diagrams with $2n$ points.

Complexity:

Comment:

A \textit{chord diagram} is a set of $2n$ points on an oriented circle (counterclockwise) joined pairwise by $n$ chords. In an experiment, their algorithm runs in almost CAT, but there is no Mathematical proof.

Reference:

[Sawada2002a] (Bibtex)