Generating connected acyclic digraphs uniformly at random

Simple item page
dc.creatorMelancon, Guy
dc.creatorPhilippe, Fabrice
dc.date2004-03-25
dc.date.accessioned2026-07-07T03:21:03Z
dc.date.available2026-07-07T03:21:03Z
dc.descriptionWe 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.
dc.description6 pages
dc.identifierhttps://arxiv.org/abs/cs/0403040
dc.identifierhttp://arxiv.org/abs/cs/0403040
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32054
dc.subjectDiscrete Mathematics
dc.subjectData Structures and Algorithms
dc.subjectF.2.2;G.2.2;G.3
dc.titleGenerating connected acyclic digraphs uniformly at random
dc.typetext

Files

Collections

arXiv