TRIÈST: Counting Triangles in Edge Streams

Introduced TRIÈST, a suite of sampling-based, one-pass algorithms for approximate triangle counting in fully-dynamic edge streams. TRIÈST stores a small, fixed-size subset of edges as a sample to continuously update triangle estimates. It achieves high accuracy and speed, processing up to 100,000 edges per second with an estimation error within 20% of the true value, a significant improvement over previous state-of-the-art.