✦ LIBER ✦

An O(tm log D) Algorithm for shortest paths

✍ Scribed by Pierre Hansen

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(mlog logD) algorithm for shortest p

✍ Rolf G. Karlsson; Patricio V. Poblete 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 178 KB

An efficient P-D algorithm for shortest

✍ Cheng'en Yang; Shuli Liang 📂 Article 📅 1997 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 243 KB

An algorithm for the ranking of shortest

✍ JoséAugusto Azevedo; Maria Emília O. Santos Costa; Joaquim João E.R. Silvestre M 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 631 KB

An efficient algorithm for K shortest si

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

An Optimal-Time Algorithm for Shortest P

✍ Yevgeny Schreiber 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 917 KB

An incremental algorithm for identificat

✍ Sandip Kundu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 398 KB