A modification of Warshall's algorithm for the transitive closure of binary relations
From MaRDI portal
Publication:4068608
DOI10.1145/360715.360746zbMath0309.94048OpenAlexW2054633003MaRDI QIDQ4068608
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) Operations research and management science (90B99) Other classical set theory (including functions, relations, and set algebra) (03E20) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (4)
An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs ⋮ Transitive closure algorithms for very large databases ⋮ Minimizing cost travel in multimodal transport using advanced relation transitive closure ⋮ Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
This page was built for publication: A modification of Warshall's algorithm for the transitive closure of binary relations
