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. 2004 Elsevier B.V. All rights reserved.

• Type: Journal
• Year: 2004
• Where: CORR
• Authors: Guy Melançon, Fabrice Philippe
• Keywords: Acyclic Directed Graphs, CORR 2004, Education, Markov Chain Process, Simple Algorithm