✦ LIBER ✦

A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem

✍ Scribed by Bang Ye Wu

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient P-D algorithm for shortest

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

An efficient VLSI algorithm for the all

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

A dual algorithm for the constrained sho

✍ Gabriel Y. Handler; Israel Zang 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 878 KB

An efficient fault-containing self-stabi

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

A Quadratic Algorithm for Finding Next-t

✍ Kuo-Hua Kao; Jou-Ming Chang; Yue-Li Wang; Justie Su-Tzu Juan 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 1022 KB

Efficient algorithms for the 2-Way Multi

✍ Huguet, Marie-José; Kirchler, Dominik; Parent, Pierre; Wolfler Calvo, Roberto 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 550 KB