A synchronous algorithm for shortest paths on a tree machine

Parallel Computing

Volumn 18, Issue 1, 1992, Pages 103-107

  El Horbaty, El Sayed M ^a   Mohamed, Alaa El Din H ^b  

^a Ain Shams University   (Egypt)

^b CAIRO UNIVERSITY   (Egypt)

Author keywords

complexity time; parallel algorithms; Shortest paths problems; tree machines

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; MATHEMATICAL TECHNIQUES - GRAPH THEORY; MATHEMATICAL TECHNIQUES - TREES;

SHORTEST PATHS PROBLEMS; SIMD MACHINES; SYNCHRONOUS ALGORITHMS; TREE MACHINES;

COMPUTER SYSTEMS PROGRAMMING;

EID: 0026652265     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-8191(92)90115-N     Document Type: Article

References (9)

1. On a routing problem
2. A tree machine for searching problems
3. Computation on a tree of processors
4. Shortest path algorithms: taxonomy and notation
5. A note on two problems in connexion with graphs
6. Algorithm 97 shortest path
7. Parallel permutation and sorting algorithms and a new generalized connection network
8. Synchronous and asynchronous algorithms for evaluating polynomials on a tree machine
9. Algorithms for shortest paths problems on an array processor