Generating connected acyclic digraphs uniformly at random
Discrete Mathematics
2007-05-23 v1 Data Structures and Algorithms
Abstract
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.
Keywords
Cite
@article{arxiv.cs/0403040,
title = {Generating connected acyclic digraphs uniformly at random},
author = {Guy Melancon and Fabrice Philippe},
journal= {arXiv preprint arXiv:cs/0403040},
year = {2007}
}
Comments
6 pages