Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)
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
Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Xiaozhu Kang, Hui Zhang, et al.
ICWS 2008