Searching for "On the Complexity of Finding Paths in a Two-Dimensional Domain II Piecewise Straight-Line Paths." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

On the complexity of finding paths in a two-dimensional domain I: Shortest paths
by Arthur W. Chou, Ker-i Ko — 2004 — in Proc. International Conference on Computability and Complexity in Analysis, 2003, Informatik Berichte 3028/2003, FernUniversität in
…Abstract On the Complexity of Finding Paths in a Two-Dimensional Domain II: Piecewise Straight-Line…
Cited by 2 (1 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB