David A. Selby
IBM J. Res. Dev
Paper
A Modification of Warshall's Algorithm for the Transitive Closure of Binary Relations
Abstract
An algorithm is given for computing the transitive closure of a binary relation that is represented by a Boolean matrix. The algorithm is similar to Warshall's although it executes faster for sparse matrices on most computers, particularly in a paging environment. © 1975, ACM. All rights reserved.
Related
Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine
Conference paper
Soft x-ray diffraction of striated muscle
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
Preeti Malakar, Thomas George, et al.
SC 2012