References
- Aho , A.V. , Hopcroft , J.E. and Ullman , J.D. 1974 . The Design and Analysis of Computer Algorithms , Reading, Mass : Addisson-Wesiey .
- Ghosh , R.K. and Bhattacharjee , G.P. 1984 . “ Parallel breadth-first search algorithms for trees and graphs ” . In Intern. J. Computer Math , Vol. 15 , 255 – 268 . Kharagpur, , India : Department of Mathematics, Indian Institute of Technology . 721302
- Preparata , F.P. August 1977 . Parallelism in Sorting, International Conference on Parallel Processing August , Belair Michigan
- Savage , C. Aug 1979 . Parallel Solutions for Graph Theoretic Problems , Aug , University of Illinois . Ph.D. Thesis CSL Report ACT-4 Coordinated Science Laboratory
- Zhang , Y. “ Parallel Algorithms for Problems Involving Directed Graphs ” . In Ph.D. Thesis , Philadelphia, PA : Drexel University . 19104