๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A simple and fast label correcting algorithm for shortest paths

โœ Scribed by Dimitri P. Bertsekas

Publisher
John Wiley and Sons
Year
1993
Tongue
English
Weight
592 KB
Volume
23
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An efficient implementation of an algori
An efficient implementation of an algorithm for findingK shortest simple paths
โœ Hadjiconstantinou, E.; Christofides, N. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 263 KB ๐Ÿ‘ 1 views

In this article, we present an efficient computational implementation of an algorithm for finding the K shortest simple paths connecting a pair of vertices in an undirected graph with n vertices, m arcs, and nonnegative arc lengths. A minimal number of intermediate paths is formed based on the metho

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