Tatsuya Imai, Kotaro Nakagawa, Aduri Pavan, N. V. Vinodchandran, Osamu Watanabe. An O(n½+∑)-Space and Polynomial-Time Algorithm for Directed Planar Reachability. In Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013. pages 277-286, IEEE, 2013. [doi]
Abstract is missing.