On the complexity of finding paths in a two-dimensional domain I: Shortest paths

Arthur W. Chou, Ker-I Ko. On the complexity of finding paths in a two-dimensional domain I: Shortest paths. Math. Log. Q., 50(6):551-572, 2004. [doi]

Abstract

Abstract is missing.