Generating connected acyclic digraphs uniformly at random
<|reference_start|>Generating connected acyclic digraphs uniformly at random: 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.<|reference_end|>
@article{melancon2004generating,
    title={Generating connected acyclic digraphs uniformly at random},
    author={Guy Melancon, Fabrice Philippe},
    journal={arXiv preprint arXiv:cs/0403040},
    year={2004},
    archivePrefix={arXiv},
    eprint={cs/0403040},
    primaryClass={cs.DM cs.DS}
}