✦ LIBER ✦

Dynamic Multi-level Overlay Graphs for Shortest Paths

✍ Scribed by Francesco Bruera; Serafino Cicerone; Gianlorenzo D’Angelo; Gabriele Di Stefano; Daniele Frigioni

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shortest paths on dynamic graphs

✍ Giacomo Nannicini; Leo Liberti 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 746 KB

Dynamic algorithms for shortest paths in

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

A Fully Dynamic Approximation Scheme for

✍ P. N. Klein; S. Subramanian 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 219 KB

Improved Algorithms for Dynamic Shortest

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

A shortest-path algorithm for Manhattan

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

A shortest path algorithm for grid graph

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