Fan Jing Meng, Ying Huang, et al.
ICEBE 2007
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
Paper
The Qx-coder
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science