✦ LIBER ✦

Efficient Algorithms for Shortest Paths in Sparse Networks

✍ Scribed by Johnson, Donald B.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Three Algorithms for Calculating Some or

✍ R. A. Whitaker 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 681 KB

Shortest viable path algorithm in multim

✍ Angelica Lozano; Giovanni Storchi 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 349 KB

An efficient algorithm for K shortest si

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

Improved Algorithms for Dynamic Shortest

✍ H. N. Djidjev; G. E. Pantziou; C. D. Zaroliagis 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 128 KB

Efficient parallel algorithms for comput

✍ Yijie Han; V. Y. Pan; J. H. Reif 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 820 KB

Time and space efficient algorithms for

✍ Hans Rohnert 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 396 KB