Affiliation:
1. IBM Thomas J. Watson Research Center, Yorktown Heights, NY
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.
Publisher
Association for Computing Machinery (ACM)
Reference5 articles.
1. A Theorem on Boolean Matrices
2. A note on multiplying Boolean matrices
3. Martynyuk V.V. Economic construction of transitive closure of binary relations. Zhurnal Vychisliteh2oi Matematiki i Matematicheskoi Fiziki 2 (July-Aug. 1962) 723-725. Martynyuk V.V. Economic construction of transitive closure of binary relations. Zhurnal Vychisliteh2oi Matematiki i Matematicheskoi Fiziki 2 (July-Aug. 1962) 723-725.
4. An algorithm for computing all paths in a graph
5. A transitive closure algorithm
Cited by
59 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Bitwise Algorithms to Compute the Transitive Closure of Graphs in Python;Lecture Notes in Computer Science;2023
2. Scheduling of Missions with Constrained Tasks for Heterogeneous Robot Systems;Electronic Proceedings in Theoretical Computer Science;2022-09-27
3. Transitive full covers of incomplete preference relations;Information Fusion;2022-04
4. Evaluation of Reachability Queries Based on Recursive DAG Decomposition;IEEE Transactions on Knowledge and Data Engineering;2022
5. Anti-Section Transitive Closure;2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC);2021-12