Hoa T. Vu

Better Algorithms for Counting Triangles in Data Streams

2016

We present space-efficient data stream algorithms for approximating the number of triangles in a graph up to a factor 1+ε. While it can be shown that determining whether a graph is triangle-free is not possible …

Distributed Data Summarization in Well-Connected Networks

2019 · International Conference on Distributed Computing

We study distributed algorithms for some fundamental problems in data summarization. Given a communication graph $G$ of $n$ nodes each of which may hold a value initially, we focus on computing $\sum_{i=1}^N g(f_i)$, where $f_i$ …