Leo Liberti, James Ostrowski
Journal of Global Optimization
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 quantitative analysis of OS noise
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
Conference paper
Low-Resource Speech Recognition of 500-Word Vocabularies
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
Liat Ein-Dor, Y. Goldschmidt, et al.
IBM J. Res. Dev