Many of today's graphs are too large to store using traditional means. Graph streaming offers a simple model for such settings: the edges of a graph arrive one by one, and an algorithm must process them on the fly using memory much smaller than the input.
Over the past twenty years, this model has become a rich meeting point. In this talk, I will give an overview of the area: what can and cannot be done in this model and why, and along the way showcase some illustrative examples.
Date
