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.
Author supplied keywords
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for freeCite
CITATION STYLE
APA
Warren, H. S. (1975). A Modification of Warshall’s Algorithm for the Transitive Closure of Binary Relations. Communications of the ACM, 18(4), 218–220. https://doi.org/10.1145/360715.360746
Readers over time
Readers' Seniority
Readers' Discipline
