𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Shortest paths on dynamic graphs

✍ Scribed by Giacomo Nannicini; Leo Liberti

Book ID
118714157
Publisher
John Wiley and Sons
Year
2008
Tongue
English
Weight
746 KB
Volume
15
Category
Article
ISSN
0969-6016

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Dynamic Multi-level Overlay Graphs for S
Dynamic Multi-level Overlay Graphs for Shortest Paths
✍ Francesco Bruera; Serafino Cicerone; Gianlorenzo D’Angelo; Gabriele Di Stefano; πŸ“‚ Article πŸ“… 2008 πŸ› Springer-Verlag 🌐 English βš– 383 KB
On Dynamic Shortest Paths Problems
On Dynamic Shortest Paths Problems
✍ Liam Roditty; Uri Zwick πŸ“‚ Article πŸ“… 2010 πŸ› Springer 🌐 English βš– 702 KB
Shortest paths in euclidean graphs
Shortest paths in euclidean graphs
✍ Robert Sedgewick; Jeffrey Scott Vitter πŸ“‚ Article πŸ“… 1986 πŸ› Springer 🌐 English βš– 971 KB
Disjoint shortest paths in graphs
Disjoint shortest paths in graphs
✍ Hikoe Enomoto; Akira Saito πŸ“‚ Article πŸ“… 1984 πŸ› Springer-Verlag 🌐 English βš– 250 KB