"Explicit N-vertex graphs with maximum degree K and diameter [1+o(1)] ..."

Michael Capalbo (2019)

> Home

Details and statistics

DOI: 10.1145/3313276.3316399

access: closed

type: Conference or Workshop Paper

metadata version: 2019-06-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/Capalbo19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/Capalbo19
Michael Capalbo:
Explicit N-vertex graphs with maximum degree K and diameter [1+o(1)] log_K-1 N for each K-1 a prime power. STOC 2019: 1191-1202

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.