✦ LIBER ✦

A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs

✍ Scribed by Kuo-Hua Kao; Jou-Ming Chang; Yue-Li Wang; Justie Su-Tzu Juan

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient algorithm to find next-to-s

✍ Sambhu Charan Barman; Sukumar Mondal; Madhumangal Pal 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 354 KB

A shortest path algorithm for grid graph

✍ F. O. Hadlock 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 547 KB

A shortest-path algorithm for Manhattan

✍ Kanchana Kanchanasut 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 420 KB

A dual simplex algorithm for finding all

✍ M. Florian; S. Nguyen; S. Pallottino 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 605 KB

Dynamic algorithms for shortest paths in

✍ Esteban Feuerstein; Alberto Marchetti-Spaccamela 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 887 KB

A polynomial-time algorithm to find shor

✍ J. Scott Provan 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB