Abstract derivation of transitive closure algorithms
From MaRDI portal
Publication:287162
DOI10.1016/S0020-0190(97)00113-0zbMATH Open1337.68283OpenAlexW2005045886MaRDI QIDQ287162FDOQ287162
Authors: L. M. G. Feijs, R. C. van Ommering 
Publication date: 26 May 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00113-0
Recommendations
- A functional, successor list based version of Warshall's algorithm with applications
- Calculating path algorithms
- Warshall's algorithm-survey and applications
- The Warshall algorithm and Dickson's lemma: Two examples of realistic program extraction
- Simple rectangle-based functional programs for computing reflexive-transitive closures
Cites Work
Cited In (11)
- Title not available (Why is that?)
- A functional, successor list based version of Warshall's algorithm with applications
- Simple rectangle-based functional programs for computing reflexive-transitive closures
- Efficient computation of transitive closures
- Warshall's algorithm-survey and applications
- Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
- An Iterative Algorithm of Computing the Transitive Closure of a Union of Parameterized Affine Integer Tuple Relations
- Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation.
- Calculating exact transitive closure for a normalized affine integer tuple relation
- Size-estimation framework with applications to transitive closure and reachability
- Computing transitive closure on systolic arrays of fixed size
This page was built for publication: Abstract derivation of transitive closure algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287162)
