𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Branch-Checking Algorithm for All-Pairs Shortest Paths

✍ Scribed by Cees Duin

Publisher
Springer
Year
2004
Tongue
English
Weight
167 KB
Volume
41
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An β€˜All Pairs Shortest Paths’ Distribute
An β€˜All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
✍ S. Haldar πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 279 KB

In an execution of a distributed program, processes communicate among themselves by exchanging messages. The execution speed of the program could be expedited by a faster message delivery system, transmitting messages to their destinations through their respective shortest paths. Some distributed al

Parallel Algorithm for Shortest Pairs of
Parallel Algorithm for Shortest Pairs of Edge-Disjoint Paths
✍ S. Banerjee; R.K. Ghosh; A.P.K. Reddy πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 241 KB

method a solution for MSP can be found within the same time bound. The problem of finding all pairs of shortest paths in a directed graph with nonnegative edge weights can be solved in O(log 2 n) time using n 3 /log n processors on a CREW PRAM [7]. Therefore, SSP can be solved within the same resou