A Hybrid Sampling Scheme for Triangle Counting

DOI10.1137/1.9781611974782.116zbMath1411.68204arXiv1610.02066OpenAlexW2951485559MaRDI QIDQ4575862

Eric Price, John Kallaugher

Publication date: 16 July 2018

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27)

Related Items (3)

On triangle estimation using tripartite independent set queries ⋮ Graph sketching and streaming: new approaches for analyzing massive graphs ⋮ A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling

This page was built for publication: A Hybrid Sampling Scheme for Triangle Counting