External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

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.

An O(n½+∑)-Space and Polynomial-Time Algorithm for Directed Planar Reachability

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]

Authors

Tatsuya Imai

This author has not been identified. Look up 'Tatsuya Imai' in Google

Kotaro Nakagawa

This author has not been identified. Look up 'Kotaro Nakagawa' in Google

Aduri Pavan

This author has not been identified. Look up 'Aduri Pavan' in Google

N. V. Vinodchandran

This author has not been identified. Look up 'N. V. Vinodchandran' in Google

Osamu Watanabe

This author has not been identified. Look up 'Osamu Watanabe' in Google
runs on