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
György E. Révész
Theoretical Computer Science
Conference paper
Performance measurement and data base design
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
Workshop paper
Accelerating Presto with GPUs
Daniel Bauer, Luis Garcés Erice, et al.
VLDB 2026