I. Alon and M. Rodeh, Finding a minimal circuit in a graph, SIAM Journal of Computing, vol.7, issue.4, pp.413-423, 1978.

E. A. Bender, L. B. Richmond, R. W. Robinson, and N. C. Wormald, The asymptotic number of acyclic digraphs. I, Combinatorica, vol.24, issue.3, pp.15-22, 1986.
DOI : 10.1007/BF02579404

I. M. Gessel, Counting acyclic digraphs by sources and sinks, Discrete Mathematics, vol.160, issue.1-3, pp.253-258, 1996.
DOI : 10.1016/0012-365X(95)00119-H
URL : http://doi.org/10.1016/0012-365x(95)00119-h

T. Koch, Steinlib testsets, 2001.
DOI : 10.1007/978-1-4613-0255-1_9
URL : http://edok01.tib.uni-hannover.de/edoks/e01fn01/337684626.pdf

B. Mckay, On the shape of a random acyclic digraph, Mathematical Proceedings of the Cambridge Philosophical Society, vol.20, issue.03, pp.459-465, 1989.
DOI : 10.1007/BF02579404

G. Melançon, I. Dutour, and M. Bousquet-mélou, Random Generation of Directed Acyclic Graphs, Comb01, Euroconference on Combinatorics, Graph Theory and Applications, 2001.
DOI : 10.1016/S1571-0653(04)00394-4

M. Patrignani, Graph drawing test suite, (see the URL www.dia.uniroma3

R. W. Robinson, Counting labeled acyclic digraphs, New Directions in the Theory of Graphs, pp.28-43, 1973.
DOI : 10.1007/bfb0069178

R. W. Robinson, Counting unlabeled acyclic digraphs, Combinatorial Mathematics V Lecture Notes in Mathematics, vol.9, pp.239-273, 1977.
DOI : 10.1016/S0021-9800(70)80089-8

A. Sinclair, Algorithms for Random Generation & Counting: A Markov Chain Approach, Progress in Theoretical Computer Science. Birkhauser, 1993.
DOI : 10.1007/978-1-4612-0323-0