Yao Qi, Raja Das, et al.
ISSTA 2009
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
Rolf Clauberg
IBM J. Res. Dev
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014