We consider the problem of estimating the number of triangles in a graph. This problem has
been extensively studied in both theory and practice, but all existing algorithms read the …

Sublinear Time Algorithms Page 1 Copyright © by SIAM. Unauthorized reproduction of this article
is prohibited. SIAM J. DISCRETE MATH. c 2011 Society for Industrial and Applied Mathematics …

A coreset of a point set P is a small weighted set of points that captures some geometric
properties of P. Coresets have found use in a vast host of geometric settings. We forge a link …

In the subgraph counting problem, we are given a input graph $ G (V, E) $ and a target
graph $ H $; the goal is to estimate the number of occurrences of $ H $ in $ G $. Our focus …

We study the problem of approximating the number of k-cliques in a graph when given query
access to the graph. We consider the standard query model for general graphs via (1) …

A dynamic geometric data stream is a sequence of m Add/Remove operations of points from
a discrete geometric space (1,..., Δ) d [21]. Add (p) inserts a point p from (1,..., Δ) d into the …

Single-threaded programming is already considered a complicated task. The move to multi-
threaded programming only increases the complexity and cost involved in software …

We give a nearly optimal sublinear-time algorithm for approximating the size of a minimum
vertex cover in a graph G. The algorithm may query the degree deg (v) of any vertex v of its …

This article surveys the many facets of the Minimum Spanning Tree problem. We follow the
history of the problem since the first polynomial-time solution by Bor˚ uvka to the modern …

We study streaming algorithms for the fundamental geometric problem of computing the cost
of the Euclidean Minimum Spanning Tree (MST) on an n-point set X⊂ ℝ d. In the streaming …