Generating connected acyclic digraphs uniformly at random
classification
💻 cs.DM
cs.DS
keywords
acyclicconnectedalgorithmdigraphsgeneratechaindescribedesigned
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.