Generating connected acyclic digraphs uniformly at random

Details Generating connected acyclic digraphs uniformly at random Generating connected acyclic digraphs uniformly at random

2004-03-25

arxiv.org/abs/cs/0403040v1

Computer Science

Discrete Mathematics

6 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Generating connected acyclic digraphs uniformly at random does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Generating connected acyclic digraphs uniformly at random, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generating connected acyclic digraphs uniformly at random will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-539462