✦ LIBER ✦

An all-pairs shortest-path distributed algorithm

✍ Scribed by Sam Toueg

Book ID: 107910858
Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 144 KB
Volume: 1
Category: Article
ISSN: 0166-5316
DOI: 10.1016/0166-5316(81)90048-1

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

An efficient VLSI algorithm for the all

An efficient VLSI algorithm for the all pairs shortest path problem

✍ Tadad Takaoka; Kiyomi Umehara 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 587 KB

A Branch-Checking Algorithm for All-Pair

A Branch-Checking Algorithm for All-Pairs Shortest Paths

✍ Cees Duin 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 167 KB

All-Pairs Almost Shortest Paths

✍ Dor, Dorit; Halperin, Shay; Zwick, Uri 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 244 KB

Another adaptive distributed shortest pa

Another adaptive distributed shortest path algorithm

✍ Humblet, P.A. 📂 Article 📅 1991 🏛 IEEE 🌐 English ⚖ 897 KB

On the all-pairs shortest-path algorithm

On the all-pairs shortest-path algorithm of Moffat and Takaoka

✍ Kurt Mehlhorn; Volker Priebe 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB 👁 3 views

We review how to solve the all-pairs shortest-path problem in a nonnegatively Ž 2 . weighted digraph with n vertices in expected time O n log n . This bound is shown to hold with high probability for a wide class of probability distributions on nonnegatively weighted Ž . digraphs. We also prove that