𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An incremental algorithm for identification of longest (shortest) paths

✍ Scribed by Sandip Kundu

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
398 KB
Volume
17
Category
Article
ISSN
0167-9260

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Incremental Algorithm for a Generaliz
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
✍ G. Ramalingam; Thomas Reps πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 363 KB

The grammar problem, a generalization of the single-source shortest-path prob-Ž Ž . Ž . . lem introduced by D. E. Knuth Inform. Process. Lett. 6 1 1977 , 1᎐5 is to compute the minimum-cost derivation of a terminal string from each nonterminal of a given context-free grammar, with the cost of a deriv

An algorithm for the ranking of shortest
An algorithm for the ranking of shortest paths
✍ JosΓ©Augusto Azevedo; Maria EmΓ­lia O. Santos Costa; Joaquim JoΓ£o E.R. Silvestre M πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 631 KB
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

An Optimal Shortest Path Parallel Algori
An Optimal Shortest Path Parallel Algorithm for Permutation Graphs
✍ O.H. Ibarra; Q. Zheng πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 512 KB

We present an optimal parallel algorithm for the single-source shortest path problem for permutation graphs. The algorithm runs in \(O(\log n)\) time using \(O(n / \log n)\) processors on an EREW PRAM. As an application, we show that a minimum connected dominating set in a permutation graph can be f