"Asymptotic enumeration of strongly connected digraphs by vertices and edges."

Xavier Pérez-Giménez, Nicholas C. Wormald (2013)

> Home

Details and statistics

DOI: 10.1002/RSA.20416

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/Perez-GimenezW13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/Perez-GimenezW13
Xavier Pérez-Giménez, Nicholas C. Wormald:
Asymptotic enumeration of strongly connected digraphs by vertices and edges. Random Struct. Algorithms 43(1): 80-114 (2013)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.