Journal of the ACM (JACM)
A note on multiplying Boolean matrices
Communications of the ACM
A study of transitive closure as a recursion mechanism
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Direct transitive closure algorithms: design and performance evaluation
ACM Transactions on Database Systems (TODS)
The input/output complexity of transitive closure
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Mixed-approach algorithms for transitive closure (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Transitive closure algorithms based on graph traversal
ACM Transactions on Database Systems (TODS)
A performance study of transitive closure algorithms
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
A Modular Systolic Linearization of the Warshall-Floyd Algorithm
IEEE Transactions on Parallel and Distributed Systems
Path queries for transportation networks: dynamic reordering and sliding window paging techniques
GIS '96 Proceedings of the 4th ACM international workshop on Advances in geographic information systems
Graph-theoretic methods in database theory
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
What You Always Wanted to Know About Datalog (And Never Dared to Ask)
IEEE Transactions on Knowledge and Data Engineering
Direct Algorithms for Computing the Transitive Closure of Database Relations
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Efficient Transitive Closure Algorithms
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Hybrid Transitive Closure Algorithms
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
A note on the transitive closure of a boolean matrix
ACM SIGACT News
On the transitive closure representation and adjustable compression
Proceedings of the 2006 ACM symposium on Applied computing
Computing SSA Form with Matrices
Electronic Notes in Theoretical Computer Science (ENTCS)
A new method for generating compressed representation of transitive closure
Proceedings of the 2008 C3S2E conference
General spanning trees and reachability query evaluation
C3S2E '09 Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering
Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
Fuzzy Sets and Systems
Service dependency model for dynamic and stateful grid services
ICA3PP'07 Proceedings of the 7th international conference on Algorithms and architectures for parallel processing
Transitive signatures from braid groups
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Finite sets of data compatible with multidimensional inequality measures
Information Sciences: an International Journal
| Hi-index | 48.22 |
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.