𝔖 Bobbio Scriptorium
✦   LIBER   ✦

ADA multitasking and the single source shortest path problem

✍ Scribed by Homer Carlisle; Albert Crawford; Sallie Sheppard

Book ID
107919190
Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
966 KB
Volume
4
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Time–Work Tradeoffs of the Single-Source
Time–Work Tradeoffs of the Single-Source Shortest Paths Problem
✍ Hanmao Shi; Thomas H Spencer πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 111 KB

We give parallel algorithms that solve the single-source shortest paths problem Ε½ . on a weighted, undirected graph with n vertices and m edges in O t lg n time and Ε½Ε½ 3 2 . Ε½ . . Ε½ . Ε½ Ε½ 3 3 O n rt lg n lg nrt q m lg n work, or in O t lg n time and O n rt q . . mnrt lg n work for any t in the range

Floats, Integers, and Single Source Shor
Floats, Integers, and Single Source Shortest Paths
✍ Mikkel Thorup πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 105 KB

Floats are ugly, but to everyone but theoretical computer scientists, they are the real thing. A linear time algorithm is presented for the undirected single-source shortest paths problem with nonnegative floating point weights.

A Simple Parallel Algorithm for the Sing
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
✍ Jesper L. TrΓ€ff; Christos D. Zaroliagis πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 216 KB

We present a simple parallel algorithm for the single-source shortest path problem in planar digraphs with nonnegative real edge weights. The algorithm runs on the EREW PRAM model of parallel computation in O((n 2= +n 1&= ) log n) time, performing O(n 1+= log n) work for any 0<=<1Γ‚2. The strength of