Faster sublinear approximation of the number of k-cliques in low-arboricity graphs

DOI10.1137/1.9781611975994.89OpenAlexW2997789361MaRDI QIDQ5146866

C. Seshadhri, Talya Eden, Dana Ron

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.04425

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Faster sublinear approximation of the number of k-cliques in low-arboricity graphs