Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
On the complexity of finding paths in a two-dimensional domain I: Shortest paths
Home
Publications
On the complexity of finding paths in a two-dimensional domain I: Shortest paths
On the complexity of finding paths in a two-dimensional domain I: Shortest paths
Authors:
AC
Arthur W. Chou
Arthur W. Chou
KK
Ker-I Ko
Ker-I Ko
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Publisher website
Google Scholar
1 October 2004
journal article
research article
Published by
Wiley
in
Mathematical Logic Quarterly
Vol. 50
(6)
,
551-572
DOI:
10.1002/malq.200310120
Abstract
No abstract available
Keywords
SHORTEST PATH
COMPUTATIONAL COMPLEXITY
POLYNOMIAL TIME
POLYNMIAL SPACE
Cited
Cited by 12 articles
Scroll to top