1 research outputs found
An Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs
Given a graph and two vertices and in it, {\em graph
reachability} is the problem of checking whether there exists a path from
to in . We show that reachability in directed layered planar graphs can
be decided in polynomial time and space, for any . The previous best known space bound for this problem with polynomial time
was approximately space \cite{INPVW13}.
Deciding graph reachability in {\SC} is an important open question in
complexity theory and in this paper we make progress towards resolving this
question