skip to main content
research-article

An O(nϵ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs

Authors Info & Claims
Published:05 December 2017Publication History
Skip Abstract Section

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.

References

  1. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  2. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  3. 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 ScholarGoogle ScholarCross RefCross Ref
  4. Sanjeev Arora and Boaz Barak. 2009. Computational Complexity - A Modern Approach. Cambridge University Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 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 ScholarGoogle Scholar
  6. 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 ScholarGoogle Scholar
  7. 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 ScholarGoogle ScholarCross RefCross Ref
  8. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  9. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  10. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  11. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  12. 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 ScholarGoogle Scholar
  13. 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 ScholarGoogle ScholarCross RefCross Ref
  14. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  15. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  16. Ashim Garg and Roberto Tamassia. 1995. Upward planarity testing. In SIAM Journal on Computing. 436--441.Google ScholarGoogle Scholar
  17. 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 ScholarGoogle Scholar
  18. 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 ScholarGoogle Scholar
  19. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  20. Harry R. Lewis and Christos H. Papadimitriou. 1982. Symmetric space-bounded computation. Theor. Comput. Sci. 19 (1982), 161--187.Google ScholarGoogle ScholarCross RefCross Ref
  21. Noam Nisan. 1995. RL ⊆ SC. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing. 619--623. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Omer Reingold. 2008. Undirected connectivity in log-space. J. ACM 55, 4 (2008), 17:1--17:24. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  24. Walter J. Savitch. 1970. Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4 (1970), 177--192. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. N. V. Vinodchandran. 2014. Space Complexity of the Directed Reachability Problem over Surface-Embedded Graphs. Technical Report TR14-008. I.Google ScholarGoogle Scholar
  26. 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 ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. An O(nϵ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!