Kento Tsubouchi, Yosuke Mitsuhashi, et al.
npj Quantum Information
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
Preeti Malakar, Thomas George, et al.
SC 2012
Conference paper
Low-Resource Speech Recognition of 500-Word Vocabularies
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
Quinn Pham, Danila Seliayeu, et al.
CASCON 2024