REFERENCES
- T Aggerwal & B Lint, Communication in parallel algorithms for boolean matrix multiplication, Proc 1978, Intl. Conf. Parallel Processing, Aug 1978, pp 146–153
- A V Alio, J E Hopcroft & J D Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974, pp 242–247
- A K Chandra, Maximal parallelism in matrix multiplication, RC-6193, IBM TJW Research Centre, 1976
- E Dekel, D Nassimi & S Sahni, Parallel matrix and graph algorithms, SIAM J Computing, vol 10, pp 657–675, 1981
- L Kucera, Parallel computation and conflicts in memory access, Information Processing Letters, vol 14, pp 93–96, 1982
- P Chaudhuri, Fast parallel algorithms for a class of graph problems, J Combinatories Information and System Sciences, to appear
- R K Ghosh & G P Bhattacharjee, A parallel search algorithm for directed acyclic graphs, BIT, vol 24, pp 134–150, 1984
- H N Gabow, A linear-time recognition algorithm for interval DAGS, Information Processing Letters, vol 12, pp 20–22, 1981
- E Reghbati & D G Corneil, Parallel computations in graph theory, SIAM J Computing, vol 2, pp 230–237, 1978
- D Heller, A survey of parallel algorithms in numerical linear algebra, SIAM Review, vol 20, pp 740–777, 1978
- M J Quinn & N Deo, Parallel graph algorithms, Computing Surveys, vol 16, pp 319–348, 1984
- Y Shiloach & U Viskhin, Finding the maximum, merging and sorting in a parallel computation model, J Algorithms, vol 2, pp 88–102, 1981