Abstract
Purchase PDF (376 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (0)
Purchase PDF (235 K)
doi:10.1016/0164-1212(86)90036-1 
Copyright © 1986 Published by Elsevier Science Inc.
An efficient parallel algorithm for the transitive closure of a graph
Available online 26 June 2003.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
We give a vectorial and parallel algorithm that performs the transitive closure of a directed graph in an average O(n2 log n) operations using an improved breadth-first method. The vectorization problem solved here gives a good example of methods efficient for graph problems. Computation on CDC CYBER 205 has proved very efficient.
