Generating connected acyclic digraphs uniformly at random

Guy Melançon, Fabrice Philippe
2004 Information Processing Letters  
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of a previous one, designed to generate acyclic digraphs, non-necessarily connected.
doi:10.1016/j.ipl.2003.06.002 fatcat:vlxbc4ppu5ge5cvozdmlfbppfq