We initiate the investigation of the parameterized complexity of Diameter and Connectivity in
the streaming paradigm. On the positive end, we show that knowing a vertex cover of size k …

Streaming is a model where an input graph is provided one edge at a time, instead of being
able to inspect it at will. In this work, we take a parameterized approach by assuming a …

Saving large graphs in memory can be problematic. Streaming the graph provides a
solution, where the graph arrives as a stream of edges. Different streaming models can be …