Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
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
Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science