Generating connected acyclic digraphs uniformly at random

Information Processing Letters

Volumn 90, Issue 4, 2004, Pages 209-213

  Melançon, Guy ^a   Philippe, Fabrice ^a  

^a LIRMM   (France)

Author keywords

Graph algorithms; Random generation; Simply connected acyclic directed graphs

Indexed keywords

ALGORITHMS; GRAPH THEORY; MARKOV PROCESSES; MATHEMATICAL MODELS; PERFORMANCE; PROBLEM SOLVING;

GRAPH ALGORITHMS; RANDOM GENERATION;

DATA PROCESSING;

EID: 1842736912     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2003.06.002     Document Type: Article

References (11)

1. Alon I., Rodeh M. Finding a minimal circuit in a graph. SIAM J. Comput. 7:(4):1978;413-423.
2. Bender E.A., Richmond L.B., Robinson R.W., Wormald N.C. The asymptotic number of acyclic digraphs. Combinatorica. 6:(1):1986;15-22.
3. Gessel I.M. Counting acyclic digraphs by sources and sinks. Discrete Math. 160:1996;253-258.
4. Jungnickel D. Graphs, Networks and Algorithms. 1999;Springer, Berlin.
5. Koch T. Steinlib testsets. see the URL http://elib.zib.de/steinlib/:2001;
6. McKay B. On the shape of a random acyclic digraph. Math. Proc. Cambridge Philos. Soc. 106:1989;459-465.
7. Melançon G., Dutour I., Bousquet-Mélou M. Random generation of directed acyclic graphs. Nesetril J., Noy M., Serra O. Comb01, Euroconference on Combinatorics, Graph Theory and Applications. Electronic Notes in Discrete Mathematics. vol. 10:2001.
8. Patrignani M. Graph drawing test suite. see the URL http://www.dia. uniroma3.it/~patrigna/.
9. Robinson R.W. Counting labeled acyclic digraphs. Harary F. New Directions in the Theory of Graphs. 1973;239-273 Academic Press, New York.
10. Robinson R.W. Counting unlabeled acyclic digraphs. Little C.H.C. Combinatorial Mathematics V, Australia. Lecture Notes in Mathematics. vol. 622:1977;28-43 Springer, Berlin.
11. Sinclair A. Algorithms for Random Generation & Counting: A Markov Chain Approach. Progress in Theoretical Computer Science. 1993;Birkhäuser, Boston, MA.