For edge coloring, the online and the W-streaming models seem somewhat
o...
In recent years, there has been a growing interest in solving various gr...
Computing a dense subgraph is a fundamental problem in graph mining, wit...
A streaming algorithm is considered to be adversarially robust if it pro...
We consider directed graph algorithms in a streaming setting, focusing o...
We study the general problem of computing frequency-based functions, i.e...
We study graph computations in an enhanced data streaming setting, where...
We study the problem of coloring a given graph using a small number of c...
In this paper, we initiate the study of the vertex coloring problem of a...