Recently, it became apparent that a large number of the most interesting structures and
phenomena of the world can be described by networks. To develop a mathematical theory of …

Property testing is concerned with the design of super-fast algorithms for the structural
analysis of large quantities of data. The aim is to unveil global features of the data, such as …

There is a rapidly growing need for scalable algorithms that solve classical graph problems,
such as maximum matching and minimum vertex cover, on massive graphs. For massive …

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 …

Local algorithms on graphs are algorithms that run in parallel on the nodes of a graph to
compute some global structural feature of the graph. Such algorithms use only local …

We show a new way to round vector solutions of semidefinite programming (SDP)
hierarchies into integral solutions, based on a connection between these hierarchies and …

Property testing algorithms are" ultra"-efficient algorithms that decide whether a given object
(eg, a graph) has a certain property (eg, bipartiteness), or is significantly different from any …

For input $ x $, let $ F (x) $ denote the set of outputs that are the" legal" answers for a
computational problem $ F $. Suppose $ x $ and members of $ F (x) $ are so large that there …

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 …

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 …