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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
