Cite
HARVARD Citation
Pérez‐Giménez, X. et al. (2013). Asymptotic enumeration of strongly connected digraphs by vertices and edges1. Random structures & algorithms. 43 (1), pp. 80-114. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Pérez‐Giménez, X. et al. (2013). Asymptotic enumeration of strongly connected digraphs by vertices and edges1. Random structures & algorithms. 43 (1), pp. 80-114. [Online].