ACM Transactions on Computation Theory (TOCT): Volume 9 Issue 4, January 2018
Citation Count: 0
Downloads (6 Weeks): 26, Downloads (12 Months): 26, Downloads (Overall): 26
Full text available:
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 ...
Directed reachability problem, layered grid graph, layered planar graph, time-space tradeoff