Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS
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
Conference paper
A privacy-protecting coupon system
Liqun Chen, Matthias Enzmann, et al.
FC 2005
Quinn Pham, Danila Seliayeu, et al.
CASCON 2024
Conference paper
Compression for data archiving and backup revisited
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009