Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
Let G = (V, E) be a graph. A set S V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in V - S. The restrained domination numb...
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
Given a graph G = (V, E), let P be a partition of V . We say that P is dominating if, for each part P of P, the set V \ P is a dominating set in G (equivalently, if every vertex h...
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...