Generating connected acyclic digraphs uniformly at random

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
6 pages

Keywords

Discrete Mathematics, Data Structures and Algorithms, F.2.2;G.2.2;G.3

Citation

URI

https://dspace.dare.co.zw/handle/123456789/43256

Collections

arXiv

Endorsement

Review

Supplemented By

Referenced By