The asymptotic number of acyclic digraphs
Combinatorica
Algorithms for random generation and counting: a Markov chain approach
Algorithms for random generation and counting: a Markov chain approach
Counting acyclic digraphs by sources and sinks
Discrete Mathematics
Genetic Representations for Evolutionary Minimization of Network Coding Resources
Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
An effective genetic algorithm for network coding
Computers and Operations Research
Random generation of deterministic acyclic automata using Markov chains
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Efficient in-network evaluation of multiple queries
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Sampling different kinds of acyclic automata using Markov chains
Theoretical Computer Science
Ranking, unranking and random generation of extensional acyclic digraphs
Information Processing Letters
| Hi-index | 0.89 |
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.