On the complexity of finding paths in a
โ
Arthur W. Chou; Ker-I Ko
๐
Article
๐
2004
๐
John Wiley and Sons
๐
English
โ 342 KB
๐ 2 views
## Abstract The computational complexity of finding a shortest path in a twoโdimensional domain is studied in the Turing machineโbased computational model and in the discrete complexity theory. This problem is studied with respect to two formulations of polynomialโtime computable twoโdimensional do