Computational experiences with some transitive closure algorithms
From MaRDI portal
Publication:1229720
DOI10.1007/BF02252834zbMath0336.05003MaRDI QIDQ1229720
J. Dzikiewicz, Maciej M. Sysło
Publication date: 1975
Published in: Computing (Search for Journal in Brave)
05C20: Directed graphs (digraphs), tournaments
68W99: Algorithms in computer science
05-04: Software, source code, etc. for problems pertaining to combinatorics
Related Items
An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs, Computational experiences with some transitive closure algorithms, On computing the transitive closure of a relation, An improved transitive closure algorithm
Cites Work
- An algorithm for finding the transitive closure of a digraph
- Computational experiences with some transitive closure algorithms
- Efficient determination of the transitive closure of a directed graph
- An algorithm for computing all paths in a graph
- A transitive closure algorithm
- The Transitive Reduction of a Directed Graph
- Depth-First Search and Linear Graph Algorithms
- A fast expected time algorithm for Boolean matrix multiplication and transitive closure
- A Theorem on Boolean Matrices
- Unnamed Item
- Unnamed Item
- Unnamed Item