Abstract
Given a graph G and two vertices s and t in it, graph reachability is the problem of checking whether there exists a path from s to t in G. We show that reachability in directed layered planar graphs can be decided in polynomial time and O(nϵ) space, for any ϵ > 0. The previous best-known space bound for this problem with polynomial time was approximately O(√ n) space (Imai et al. 2013).
Deciding graph reachability in SC (Steve's class) is an important open question in complexity theory, and in this article, we make progress toward resolving this question.
- Eric Allender. 2007. Reachability problems: An update. In Proceedings of Computation and Logic in the Real World, 3rd Conference on Computability in Europe (CiE’07). 25--27. Google Scholar
Digital Library
- Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, and Sambuddha Roy. 2009. Planar and grid graph reachability problems. Theory Comput. Syst. 45, 4 (2009), 675--723. Google Scholar
Digital Library
- Eric Allender and Klaus-Jörn Lange. 1998. RUSPACE(log n) ⊆ DSPACE (log2n / log log n). Theory Comput. Syst. 31, 5 (1998), 539--550.Google Scholar
Cross Ref
- Sanjeev Arora and Boaz Barak. 2009. Computational Complexity - A Modern Approach. Cambridge University Press. Google Scholar
Digital Library
- Tetsuo Asano and Benjamin Doerr. 2011. Memory-constrained algorithms for shortest path problem. In Proceedings of the 23rd Annual Canadian Conference on Computational Geometry.Google Scholar
- Tetsuo Asano, David G. Kirkpatrick, Kotaro Nakagawa, and Osamu Watanabe. 2014. Õ(√n)-Space and polynomial-time algorithm for planar directed graph reachability. In Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science 2014, Part II, MFCS 2014, Budapest, Hungary, August 25-29, 2014. 45--56.Google Scholar
- Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, and Baruch Schieber. 1992. A sublinear space, polynomial time algorithm for directed s-t connectivity. In Proceedings of the 7th Annual Structure in Complexity Theory Conference. 27--33.Google Scholar
Cross Ref
- Giuseppe Di Battista, Wei-Ping Liu, and Ivan Rival. 1990. Bipartite graphs, upward drawings, and planarity. Inf. Process. Lett. 36, 6 (1990), 317--322. Google Scholar
Digital Library
- Giuseppe Di Battista and Roberto Tamassia. 1987. Upward drawings of acyclic digraphs. In Proceedings of the Graph-Theoretic Concepts in Computer Science, International Workshop, WG’87, Kloster Banz/Staffelstein, Germany, June 29 - July 1, 1987. 121--133. Google Scholar
Digital Library
- Chris Bourke, Raghunath Tewari, and N. V. Vinodchandran. 2009. Directed planar reachability is in unambiguous log-space. ACM Trans. Comput. Theory 1, 1 (2009), 1--17. Google Scholar
Digital Library
- Gerhard Buntrock, Birgit Jenner, Klaus-Jrn Lange, and Peter Rossmanith. 1991. Unambiguity and fewness for logarithmic space. In Fundamentals of Computation Theory, L. Budach (Ed.). Lecture Notes in Computer Science, Vol. 529. Springer Berlin, 168--179. Google Scholar
Digital Library
- Diptarka Chakraborty, Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran, and Lin F. Yang. 2014. New time-space upperbounds for directed reachability in high-genus and h-minor-free graphs. In Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS’14). 585--595.Google Scholar
- Diptarka Chakraborty and Raghunath Tewari. 2015. An O(nε) space and polynomial time algorithm for reachability in directed layered planar graphs. In Proceedings of the 26th International Symposium on Algorithms and Computation, ISAAC 2015, Nagoya, Japan, December 9-11, 2015. 614--624.Google Scholar
Cross Ref
- Kai-Min Chung, Omer Reingold, and Salil Vadhan. 2011. S-T connectivity on digraphs with a known stationary distribution. ACM Trans. Algorithms 7, 3, Article 30 (July 2011), 21 pages. Google Scholar
Digital Library
- S. A. Cook. 1979. Deterministic CFL’s are accepted simultaneously in polynomial time and log squared space. In Proceedings of the 11th Annual ACM Symposium on Theory of Computing. ACM, 338--345. Google Scholar
Digital Library
- Ashim Garg and Roberto Tamassia. 1995. Upward planarity testing. In SIAM Journal on Computing. 436--441.Google Scholar
- T. Imai, K. Nakagawa, A. Pavan, N. V. Vinodchandran, and O. Watanabe. 2013. An O(n1/2+ε)-space and polynomial-time algorithm for directed planar reachability. In Proceedings of the 2013 IEEE Conference on Computational Complexity (CCC). 277--286.Google Scholar
- Sampath Kannan, Sanjeev Khanna, and Sudeepa Roy. 2008. STCON in directed unique-path graphs. In Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Leibniz International Proceedings in Informatics (LIPIcs)), Ramesh Hariharan, Madhavan Mukund, and V Vinay (Eds.), Vol. 2. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 256--267.Google Scholar
- Klaus-Jörn Lange. 1997. An unambiguous class possessing a complete set. In Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS’97). 339--350. Google Scholar
Digital Library
- Harry R. Lewis and Christos H. Papadimitriou. 1982. Symmetric space-bounded computation. Theor. Comput. Sci. 19 (1982), 161--187.Google Scholar
Cross Ref
- Noam Nisan. 1995. RL ⊆ SC. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing. 619--623. Google Scholar
Digital Library
- Omer Reingold. 2008. Undirected connectivity in log-space. J. ACM 55, 4 (2008), 17:1--17:24. Google Scholar
Digital Library
- Omer Reingold, Luca Trevisan, and Salil Vadhan. 2006. Pseudorandom walks on regular digraphs and the RL vs. L problem. In STOC’06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing. ACM, New York, NY, 457--466. Google Scholar
Digital Library
- Walter J. Savitch. 1970. Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4 (1970), 177--192. Google Scholar
Digital Library
- N. V. Vinodchandran. 2014. Space Complexity of the Directed Reachability Problem over Surface-Embedded Graphs. Technical Report TR14-008. I.Google Scholar
- Avi Wigderson. 1992. The complexity of graph connectivity. In Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science 1992, MFCS’92, Prague, Czechoslovakia, August 24-28, 1992. 112--132. Google Scholar
Digital Library
Index Terms
An O(nϵ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs
Recommendations
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity
Directed s-t connectivity is the problem of detecting whether there is a path from vertex s to vertex t in a directed graph. We present the first known deterministic sublinear space, polynomial time algorithm for directed s-t connectivity. For $n$-...
Space-efficient algorithms for reachability in directed geometric graphs
AbstractThe problem of graph Reachability is to decide whether there is a path from one vertex to another in a given graph. In this paper, we study the Reachability problem on three distinct graph families - intersection graphs of Jordan ...
Super-linear time-space tradeoff lower bounds for randomized computation
FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer ScienceWe prove the first time-space lower bound tradeoffs for randomized computation of decision problems. The bounds hold even in the case that the computation is allowed to have arbitrary probability of error on a small fraction of inputs. Our techniques ...






Comments