B. Roy, Transitivit'e et connexit'e, C.R. Acad. Sci. Paris 249 (1959) 216--218. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Parallel Algorithm For Transitive Closure - Cáceres, Song (Correct)
....n, and each processor has O( mn p ) local memory. The local computation of each processor is equal to the product of the number of edges and vertices of D that are stored in p. 1 Introduction The problem of computing the transitive closure of a digraph was first considered in 1959 by B. Roy [15] and a variety of sequential algorithms to solve this problem have been proposed ever since [1, 2, 7, 8, 9, 14, 16, 19] These sequential solutions, usually 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 ....
B. Roy, Transitivit'e et connexit'e, C.R. Acad. Sci. Paris 249 (1959) 216--218.
A Parallel Algorithm for Transitive Closure - Caceres, Song (Correct)
....each processor is equal to the product of the number of edges and vertices of D that are stored in p. KEY WORDS Parallel algorithm, transitive closure, graph algorithm, CGM, BSP 1 Introduction The problem of computing the transitive closure of a digraph was first considered in 1959 by B. Roy [15] and a variety of sequential algorithms to solve this problem have been proposed ever since [1, 2, 7, 8, 9, 14, 16, 19] These sequential solutions, usually 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 ....
B. Roy, Transitivite et connexite, C.R. Acad. Sci. Paris 249 (1959) 216--218.
Algorithms To Schedule Tasks With And/or Precedence Constraints - Gillies (1993) (6 citations) (Correct)
....for the work on series parallel precedence constraints in this thesis. 6.5. Path Problems on Directed Graphs One of the critical algorithms used in this thesis is the algorithm to compute the transitive closure of an AND OR graph. This algorithm is based on the algorithm of Roy and Warshall [Roy59] [Warshall62] to compute transitive closure; hereafter it will be referred to as Warshall s algorithm. Since the publication of that algorithm, many subsequent algorithms have been 94 proposed and the dynamic programming approach in the algorithm has been greatly extended. There have been at ....
Roy, B. Transitivite et Connexite. Compt. Rend. (1959) vol. 249, pp. 216-218.
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