Tabulation of Noncrossing Acyclic Digraphs

Marco Kuhlmann

I present an algorithm that, given a number $n\ge 1$, computes a compact representation of the set of all noncrossing acyclic digraphs with $n$ nodes. This compact representation…