A synchronous algorithm for shortest paths on a tree machine
El-Sayed M. El-Horbaty; Mohamed, Alaa El Din H.;
Abstract
This paper presents a synchronous (SIMD) algorithm for solving the single source problem for finding shortest paths in a network on a tree machine model. The algorithm requires O(N log2 N) complexity time using a tree machine with N leaf processing elements. © 1992.
Other data
| Title | A synchronous algorithm for shortest paths on a tree machine | Authors | El-Sayed M. El-Horbaty ; Mohamed, Alaa El Din H. | Keywords | complexity time;parallel algorithms;tree machines;Shortest paths problems | Issue Date | 1-Jan-1992 | Journal | Parallel Computing | Volume | 18 | Issue | 1 | Start page | 103 | End page | 107 | ISSN | 01678191 | DOI | 10.1016/0167-8191(92)90115-N | Scopus ID | 2-s2.0-0026652265 |
Recommend this item
Similar Items from Core Recommender Database
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.