Yao Qi, Raja Das, et al.
ISSTA 2009
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.
Yao Qi, Raja Das, et al.
ISSTA 2009
Rajeev Gupta, Shourya Roy, et al.
ICAC 2006
Rolf Clauberg
IBM J. Res. Dev
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014