✦ LIBER ✦

A decomposition algorithm for shortest paths in a network with many strongly connected components

✍ Scribed by P. Brucker

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A decomposition algorithm for locating a

✍ John J. Jarvis; Suleyman Tufekci 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 505 KB

A two-phase shortest path algorithm for

✍ Jens Lysgaard 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 389 KB

Decomposition algorithms for finding the

✍ Suleyman Tufekci 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 489 KB

A hill-jump algorithm of Hopfield neural

✍ Rong-Long Wang; Shan-Shan Guo; Kozo Okazaki 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 314 KB

R-Kleene: A High-Performance Divide-and-

✍ Paolo D'Alberto; Alexandru Nicolau 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 195 KB

GPSPA: a new adaptive algorithm for main

✍ Sudip Misra; B. John Oommen 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB 👁 2 views