Sepehr Assadi, Rutgers University

Abstract

In the graph steaming model, the edges of a graph are presented one by one in an arbitrary order and the algorithms can make one or a limited number of sequential passes over this stream, while using a limited memory to process the graph. In this talk, we will survey the current landscape of multi-pass graph streaming lower bounds, including several recent advances and mention some fundamental problems that are still widely open in this area.

See: https://theory.cs.rutgers.edu/theory_seminar