SIGN IN
SIGN UP
A modification of Warshall's algorithm for the transitive closure of binary relations
Full Text:
PDF
Buy this Article
Author:
Henry S. Warren, Jr.
IBM Thomas J. Watson Research Center, Yorktown Heights, NY
Published in:
· Magazine
Communications of the ACM
CACM Homepage
archive
Volume 18 Issue 4, April 1975
Pages 218-220
ACM
New York, NY
, USA
table of contents
doi>
10.1145/360715.360746
1975 Article
Bibliometrics
· Downloads (6 Weeks): 7
· Downloads (12 Months): 53
· Downloads (cumulative): 1,041
· Citation Count: 21
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
binary relation
boolean matrix
computations on matrices
design
digraph
directed graph
general
reachability matrix
theory
transitive closure
warshall's algorithm
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder