Generating connected acyclic digraphs uniformly at random
Guy Melancon, Fabrice Philippe
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.
Create a lesson
Related papers
Integrality gap preserving reductions
Koppány István Encz, Monaldo Mastrolilli, Eleonora Vercesi
Structural Parameterizations for Eternal Vertex Cover
Neeldhara Misra, Sebastian Ordyniak, Giacomo Paesani et al.
Ramsey Obstructions to Disambiguation
Romain Bourneuf, Antonin Kiladjian, Stéphan Thomassé
Two-Machine Flow Shop with a Fixed Non-Availability Interval on the Second Machine
Hao Lu, Yuan Yuan, Xingwu Liu et al.
Tournaments not inducible by five voters
Leonid Chindelevitch, Ararat Harutyunyan
Oblivious Self-Distance Symmetric Rendezvous on the Integer Line
Konstantinos Georgiou, Claude Gravel, Lazar Mandic et al.