Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs

Martin Pépin, Alfredo Viola

Directed acyclic graphs (DAGs) are directed graphs in which there is no path from a vertex to itself. DAGs are an omnipresent data structure in computer science and the problem of…