An improved transitive closure algorithm
From MaRDI portal
Publication:1836309
DOI10.1007/BF02242140zbMath0504.68042MaRDI QIDQ1836309
Publication date: 1983
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02242140
68R10: Graph theory (including graph drawing) in computer science
Related Items
Finite sets of data compatible with multidimensional inequality measures, An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs, On finding the strongly connected components in a directed graph, An efficient transitive closure algorithm for cyclic digraphs, Minimizing cost travel in multimodal transport using advanced relation transitive closure
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A sensitive transitive closure algorithm
- 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
- On computing the time complexity of transitive closure algorithms
- A transitive closure algorithm
- The Transitive Reduction of a Directed Graph
- Depth-First Search and Linear Graph Algorithms
- A Theorem on Boolean Matrices