PARALLEL SEARCH ALGORITHMS FOR TREES AND GRAPHS

Tree and graph searching are of fundamental importance, since they form the basis for solving a wide range of other graph theory problems. Parallel algorithms developed for different types of tree and graph searching problems are mainly based on shared memory model of the single-instruction stream, multiple-data stream computer. This computational model may be viewed as a parallel variant of the standard Random Access Machine (RAM) model of sequential computation and is commonly known as parallel-RAM or PRAM in the literature. This paper aims in reviewing the algorithms for tree and graph searching problems on various PRAM models.