TRIEST: Counting Local and Global Triangles in Fully-Dynamic Streams with Fixed Memory Size thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

TRIEST: Counting Local and Global Triangles in Fully-Dynamic Streams with Fixed Memory Size

Published on Sep 27, 20161177 Views

We present TRIEST, a suite of one-pass streaming algorithms to compute unbiased, low-variance, high-quality approximations of the global and local (i.e., incident to each vertex) number of triangles i

Related categories