Edge sampling and graph parameter estimation via vertex neighborhood accesses

DOI10.1145/3519935.3520059arXiv2107.03821WikidataQ130871532 ScholiaQ130871532MaRDI QIDQ6083564

Jakub Tětek, Mikkel Thorup

Publication date: 8 December 2023

Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

triangle countingsublinear-time algorithmsedge samplingedge counting

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Edge sampling and graph parameter estimation via vertex neighborhood accesses