𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Shortest paths through two-tone pairs

✍ Scribed by T. Epping; W. Hochstättler

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
79 KB
Volume
13
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

All-pairs shortest-paths computation in
All-pairs shortest-paths computation in the presence of negative cycles
✍ Kurt Mehlhorn; Volker Priebe; Guido Schäfer; Naveen Sivadasan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 49 KB

We present an algorithm that solves the all-pairs shortest-paths problem on a directed graph with n vertices and m arcs in time O(nm + n 2 log n), where the arcs are assigned real, possibly negative costs. Our algorithm is new in the following respect. It computes the distance µ(v, w) between each p

A new approach to all-pairs shortest pat
A new approach to all-pairs shortest paths on real-weighted graphs
✍ Seth Pettie 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 380 KB

We present a new all-pairs shortest path algorithm that works with real-weighted graphs in the traditional comparison-addition model. It runs in O(mn + n 2 log log n) time, improving on the long-standing bound of O(mn + n 2 log n) derived from an implementation of Dijkstra's algorithm with Fibonacci

On the Exponent of the All Pairs Shortes
On the Exponent of the All Pairs Shortest Path Problem
✍ Noga Alon; Zvi Galil; Oded Margalit 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 900 KB

The upper bound on the exponent, |, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, the exponent of the algorithms known for the all pairs shortest path problem has stayed at three all these years even for t