Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs.

Talya Eden, Dana Ron, Will Rosenbaum

Browse the full ICALP paper archive.