Space Lower Bounds for Graph Stream Problems

  • Paritosh VermaEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11436)


This work concerns with proving space lower bounds for graph problems in streaming model. It is known that the single source shortest path problem in streaming model requires \(\varOmega (n)\) space, where \(|V|=n\). In the first part of the paper we try find whether the same lower bound hold for a similar problem defined on trees. We prove lower bounds for single and multi pass version of the problem.

We then apply the ideas used in above lower bound results to prove space lower bounds (single and multipass) for other graph problems like finding min s-t cut, detecting negative weight cycle and finding whether two nodes lie in the same strongly connected component.


  1. 1.
    Chakrabarti, A.: Data Stream Algorithms, Lecture Notes, Fall 2011, October 2014Google Scholar
  2. 2.
    Guruswami, V., Onak, K.: Superlinear lower bounds for multipass graph processing. Algorithmica 76(3), 654–683 (2016). Scholar
  3. 3.
    McGregor, A.: Graph stream algorithms: a survey. SIGMOD Rec. 43(1), 9–20 (2014). Scholar
  4. 4.
    Nisan, N., Wigderson, A.: Rounds in communication complexity revisited. SIAM J. Comput. 22(1), 211–219 (1993). Scholar
  5. 5.
    Roughgarden, T.: Communication complexity for algorithm designers. Found. Trends Theor. Comput. Sci. 11(3–4), 217–404 (2016). Scholar
  6. 6.
    Zelke, M.: Intractability of min- and max-cut in streaming graphs. Inf. Process. Lett. 111(3), 145–150 (2011). Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Birla Institute of Technology & Science, PilaniPilaniIndia

Personalised recommendations