14 citations · 20 across the 3 of their papers we have counts for
1 paper · 1 filter
Diptaksho Palit, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova +1
We revisit the classical problem of testing connectedness of graphs represented in the adjacency lists model and obtain optimal bounds. Specifically, we show that ε-tes…