✦ LIBER ✦

An algorithm for finding all shortest paths using N2.81 infinite-precision multiplications

✍ Scribed by G. Yuval

Book ID: 113161879
Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 261 KB
Volume: 4
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(76)90085-5

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

A New Algorithm for Finding All Shortest

A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time $O(n^2 \log ^2 n)$

✍ Spira, P. M. 📂 Article 📅 1973 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 509 KB

A simpleO(n2) algorithm for the all-pair

A simpleO(n2) algorithm for the all-pairs shortest path problem on an interval graph

✍ Mirchandani, Prakash 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB 👁 3 views

Let G denote an interval graph with n vertices and unit weight edges. In this paper, we present a simple O(n') algorithm for solving the all-pairs shortest path problem on graph G . A recent algorithm for this problem has the same time-complexity but is fairly complicated to describe. However, our a