Generating connected acyclic digraphs uniformly at random [article]

Guy Melancon, Fabrice Philippe
2004 arXiv   pre-print
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.
arXiv:cs/0403040v1 fatcat:73cdb2sutrhk3ooepnsq24vutq