Cite
APA Citation
Pittel, B. (2013). counting strongly‐connected, moderately sparse directed graphs. Random structures & algorithms, 43(1), 49–79. http://access.bl.uk/ark:/81055/vdc_100024753300.0x000045
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Pittel, B. (2013). counting strongly‐connected, moderately sparse directed graphs. Random structures & algorithms, 43(1), 49–79. http://access.bl.uk/ark:/81055/vdc_100024753300.0x000045