Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling
Algorithmica, Volume 80, Issue 2, 2018, Pages 668-697.
SubgraphsApproximate countingRandomized algorithmsSublinear-time algorithms
We study the problem of estimating the value of sums of the form when one has the ability to sample with probability proportional to its magnitude. When , this problem is equivalent to estimating the selectivity of a self-join query in database systems when one can sample rows randomly. We also study the special case when is the degree...More
Full Text (Upload PDF)
PPT (Upload PPT)