Sampling edges from a graph in sublinear time is a fundamental problem a...
In classical statistics and distribution testing, it is often assumed th...
We propose data-driven one-pass streaming algorithms for estimating the
...
A* is a classic and popular method for graphs search and path finding. I...
We consider the problem of approximating the arboricity of a graph G=
(V...
Sampling random nodes is a fundamental algorithmic primitive in the anal...
A streaming algorithm is adversarially robust if it is guaranteed to per...
We consider the problem of sampling and approximately counting an arbitr...
We consider the problem of estimating the number of distinct elements in...
In this work, we consider the problem of sampling a k-clique in a graph
...
We present a sublinear time algorithm that allows one to sample multiple...
Subgraph counting is a fundamental problem in analyzing massive graphs, ...
In this paper, we revisit the problem of sampling edges in an unknown gr...
Given query access to an undirected graph G, we consider the problem of
...
The degree distribution is one of the most fundamental properties used i...
We present a new framework for proving query complexity lower bounds for...