Abstract
AbstractThe graph reachability problem, the computational task of deciding whether there is a path between two given nodes in a graph, is the canonical problem for studying space-bounded computations. Three central open questions regarding the space complexity of the reachability problem over directed graphs are: (1) improving Savitch’s \(O(\log ^2 n)\) space bound, (2) designing a polynomial-time algorithm with \(O(n^{1-\epsilon })\) space bound, and (3) designing an unambiguous non-deterministic log-space (UL) algorithm. These are well-known open questions in complexity theory, and solving any one of them will be a major breakthrough. We discuss some of the recent progress reported on these questions for certain subclasses of surface-embedded directed graphs.KeywordsGraph reachabilitySpace-bounded computationComputational complexityMathematics Subject Classification (2010)Primary 68Q15
Sign-in/Register to access full text options 
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.
