A modification of Warshall's algorithm for the transitive closure of binary relations
DOI10.1145/360715.360746zbMATH Open0328.05001OpenAlexW2054633003MaRDI QIDQ4093445FDOQ4093445
Authors: Henry S. jun. Warren 
Publication date: 1975
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/360715.360746
Extremal problems in graph theory (05C35) Other classical set theory (including functions, relations, and set algebra) (03E20) Software, source code, etc. for problems pertaining to combinatorics (05-04) Operations research and management science (90B99)
Cited In (6)
- The input/output complexity of transitive closure
- Dynamic maintenance of the transitive closure in disjunctive graphs
- Transitive Signatures from Braid Groups
- Finite sets of data compatible with multidimensional inequality measures
- An efficient database transitive closure algorithm
- Algorithm partition and parallel recognition of general context-free languages using fixed-size VLSI architecture
This page was built for publication: A modification of Warshall's algorithm for the transitive closure of binary relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4093445)
