A streaming algorithm is considered to be adversarially robust if it provides correct outputs
with high probability even when the stream updates are chosen by an adversary who may …

Every graph with maximum degree Δ can be colored with (Δ+ 1) colors using a simple
greedy algorithm. Remarkably, recent work has shown that one can find such a coloring …

Graph coloring is a fundamental problem with wide reaching applications in various areas
including ata mining and databases, eg, in parallel query optimization. In recent years, there …

Recent breakthroughs in graph streaming have led to design of semi-streaming algorithms
for various graph coloring problems such as (Δ+ 1)-coloring, degeneracy-coloring, coloring …

For edge coloring, the online and the W-streaming models seem somewhat orthogonal: the
former needs edges to be assigned colors immediately after insertion, typically without any …

Structured data-sets are often easy to represent using graphs. The prevalence of massive
data-sets in the modern world gives rise to big graphs such as web graphs, social networks …