Skip to content
cs-conference-ranking.org

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

Michael Capalbo

VenueA*STOC
Year2019
ProceedingsSTOC
DBLP recordconf/stoc/Capalbo19 ↗

Browse the full STOC paper archive.