Sciweavers

Share
CORR
2004
Springer

Generating connected acyclic digraphs uniformly at random

11 years 9 months ago
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.
Guy Melançon, Fabrice Philippe
Added 17 Dec 2010
Updated 17 Dec 2010
Type Journal
Year 2004
Where CORR
Authors Guy Melançon, Fabrice Philippe
Comments (0)
books