Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Diptarka Chakraborty, Raghunath Tewari. An $O(n^{\epsilon})$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. Electronic Colloquium on Computational Complexity (ECCC), 22:16, 2015. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: An O(n^ε ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar GraphsDiptarka Chakraborty, Raghunath Tewari. isaac 2015: 614-624 [doi] ε) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar GraphsDiptarka Chakraborty, Raghunath Tewari. toct, 9(4), 2018. [doi] An O(n^(1/4 +epsilon)) Space and Polynomial Algorithm for Grid Graph ReachabilityRahul Jain, Raghunath Tewari. fsttcs 2019: [doi]
The following publications are possibly variants of this publication: