| A.A. Toptsis, Parallel transitive closure for multiprocessor, in: International Conference on Computing and Information, Lecture Notes in Computer Science, V. 497 (1991) 197--206. |
.... are based on the use of the adjacency matrix of the digraph, considered as a Boolean matrix or use the adjacency matrix in more directed terms as a problem representation [13] Parallel algorithms for this problem where presented by [10, 12] PRAM) 11] Arrays and Trees and Meshes of Trees) and [17] (Highly Scalable Multiprocessors) We present an algorithm for computing the transitive closure of an acyclic digraph using the BSP CGM Model. Partially supported by FINEP PRONEX SAI Proc. No. 76.97.1022.00. Partially supported by FAPESP Proc. No. 98 06138 2, CNPq Proc. No. 52.3778 96 1 ....
A.A. Toptsis, Parallel transitive closure for multiprocessor, in: International Conference on Computing and Information, Lecture Notes in Computer Science, V. 497 (1991) 197--206.
.... are based on the use of the adjacency matrix of the digraph, considered as a Boolean matrix or use the adjacency matrix in more directed terms as a problem representation [13] Parallel algorithms for this problem where presented by [10, 12] PRAM) 11] Arrays and Trees and Meshes of Trees) and [17] (Highly Scalable Multiprocessors) We present an algorithm for computing the transitive closure of an acyclic digraph using the BSP CGM Model. Partially supported by CNPq and FINEP PRONEX SAI Proc. No. 76.97.1022.00. Partially supported by FAPESP Proc. No. 99 07390 0, CNPq Proc. No. ....
A.A. Toptsis, Parallel transitive closure for multiprocessor, in: International Conference on Computing and Information, Lecture Notes in Computer Science, V. 497 (1991) 197--206.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC