Title :
A new parallel algorithm for breadth-first search on interval graphs
Author :
Das, Sajal K. ; Chen, Calvin C -Y
Author_Institution :
Dept. of Comput. Sci., North Texas Univ., Denton, TX, USA
Abstract :
The authors design an efficient parallel algorithm for constructing a breadth-first spanning tree of an interval graph. Their novel approach is based on elegantly capturing the structure of a given collection of intervals. This structure reveals important properties of the corresponding interval graph, and is found to be instrumental in solving many other problems including the computation of a breadth-depth spanning tree, which they report for the first time. The algorithm requires O(logn) time employing O(n) processors on the EREW PRAM model
Keywords :
computational complexity; graph theory; parallel algorithms; search problems; EREW PRAM model; breadth-depth spanning tree; breadth-first search; breadth-first spanning tree; interval graphs; parallel algorithm; Algorithm design and analysis; Biological system modeling; Computer science; Environmental factors; Genetics; Parallel algorithms; Phase change random access memory; Scheduling; Terminology; Tree graphs;
Conference_Titel :
Parallel Processing Symposium, 1992. Proceedings., Sixth International
Conference_Location :
Beverly Hills, CA
Print_ISBN :
0-8186-2672-0
DOI :
10.1109/IPPS.1992.223055
