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

Published: 01 Jan 2015, Last Modified: 12 Jun 2024ISAAC 2015EveryoneRevisionsBibTeXCC BY-SA 4.0
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^\epsilon )\) space, for any \(\epsilon > 0\). The previous best known space bound for this problem with polynomial time was approximately \(O(\sqrt{n})\) space [1].
Loading

OpenReview is a long-term project to advance science through improved peer review with legal nonprofit status. We gratefully acknowledge the support of the OpenReview Sponsors. © 2025 OpenReview