𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finding the Kth shortest path in a time-schedule network

✍ Scribed by Yen-Liang Chen; Kwei Tang

Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
144 KB
Volume
52
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of finding paths in a
On the complexity of finding paths in a two-dimensional domain I: Shortest paths
✍ 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