Approximately counting triangles in sublinear time

DOI10.1109/FOCS.2015.44MaRDI QIDQ6946868zbMATH OpenFDO

Authors Dana Ron, C. Seshadhri, Amit Levi, Talya Eden

Publication date 5 August 2025

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx) Theory of computing (68Qxx)

This page was built for publication: Approximately counting triangles in sublinear time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6946868)