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
Zohar Feldman, Avishai Mandelbaum
WSC 2010
Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory
Robert E. Donovan
INTERSPEECH - Eurospeech 2001