default search action
"Explicit N-vertex graphs with maximum degree K and diameter [1+o(1)] ..."
Michael Capalbo (2019)
- Michael Capalbo:
Explicit N-vertex graphs with maximum degree K and diameter [1+o(1)] logK-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.