Computer Science > Computational Complexity
[Submitted on 20 Nov 2020]
Title:Space Lower Bounds for Graph Stream Problems
View PDFAbstract:This work concerns with proving space lower bounds for graph problems in the streaming model. It is known that computing the length of shortest path between two nodes in the streaming model requires $\Omega(n)$ space, where $n$ is the number of nodes in the graph. We study the problem of finding the depth of a given node in a rooted tree in the streaming model. For this problem we prove a tight single pass space lower bound and a multipass space lower bound. As this is a special case of computing shortest paths on graphs, the above lower bounds also apply to the shortest path problem in the streaming model. The results are obtained by using known communication complexity lower bounds or by constructing hard instances for the problem. Additionally, we apply the techniques used in proving the 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.
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
Connected Papers (What is Connected Papers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.