𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs

✍ Scribed by P. N. Klein; S. Subramanian

Book ID
105746477
Publisher
Springer
Year
1998
Tongue
English
Weight
219 KB
Volume
22
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A fully dynamic algorithm for distribute
A fully dynamic algorithm for distributed shortest paths
✍ Serafino Cicerone; Gabriele Di Stefano; Daniele Frigioni; Umberto Nanni πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 297 KB

We propose a fully dynamic distributed algorithm for the all-pairs shortest paths problem on general networks with positive real edge weights. If is the number of pairs of nodes changing the distance after a single edge modiΓΏcation (insert, delete, weight decrease, or weight increase) then the messa