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

A sharper analysis of a parallel algorithm for the all pairs shortest path problem

โœ Scribed by Qian Ping Gu; Tadao Takaoka

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
457 KB
Volume
16
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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

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