A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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