𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Optimal Algorithm for Euclidean Shortest Paths in the Plane

✍ Scribed by Hershberger, John; Suri, Subhash

Book ID
118178172
Publisher
Society for Industrial and Applied Mathematics
Year
1999
Tongue
English
Weight
584 KB
Volume
28
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Optimal Shortest Path Parallel Algori
An Optimal Shortest Path Parallel Algorithm for Permutation Graphs
✍ O.H. Ibarra; Q. Zheng πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 512 KB

We present an optimal parallel algorithm for the single-source shortest path problem for permutation graphs. The algorithm runs in \(O(\log n)\) time using \(O(n / \log n)\) processors on an EREW PRAM. As an application, we show that a minimum connected dominating set in a permutation graph can be f

An algorithm for the ranking of shortest
An algorithm for the ranking of shortest paths
✍ JosΓ©Augusto Azevedo; Maria EmΓ­lia O. Santos Costa; Joaquim JoΓ£o E.R. Silvestre M πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 631 KB