"Explicit sparse almost-universal graphs for G(n, k/n)."

Michael R. Capalbo (2010)

> Home

Details and statistics

DOI: 10.1002/RSA.20337

access: closed

type: Journal Article

metadata version: 2021-06-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/Capalbo10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/Capalbo10
Michael R. Capalbo:
Explicit sparse almost-universal graphs for G(n, k/n). Random Struct. Algorithms 37(4): 437-454 (2010)

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.