✦ LIBER ✦

An efficient P-D algorithm for shortest path problem

✍ Scribed by Cheng'en Yang; Shuli Liang

Publisher: Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 1997
Tongue: English
Weight: 243 KB
Volume: 13
Category: Article
ISSN: 0168-9673
DOI: 10.1007/bf02015143

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient VLSI algorithm for the all

✍ Tadad Takaoka; Kiyomi Umehara 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 587 KB

An efficient fault-containing self-stabi

✍ Tetz C. Huang 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 369 KB

An efficient algorithm for K shortest si

✍ N. Katoh; T. Ibaraki; H. Mine 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 878 KB

An algorithm for the resource constraine

✍ J. E. Beasley; N. Christofides 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 812 KB

An O(tm log D) Algorithm for shortest pa

✍ Pierre Hansen 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 348 KB

Shortest path algorithms for knapsack ty

✍ A. M. Frieze 📂 Article 📅 1976 🏛 Springer-Verlag 🌐 English ⚖ 484 KB