Abstract derivation of transitive closure algorithms
From MaRDI portal
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)- Size-estimation framework with applications to transitive closure and reachability
- Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
- scientific article; zbMATH DE number 1208713 (Why is no real title available?)
- Efficient computation of transitive closures
- An Iterative Algorithm of Computing the Transitive Closure of a Union of Parameterized Affine Integer Tuple Relations
- Calculating exact transitive closure for a normalized affine integer tuple relation
- Computing transitive closure on systolic arrays of fixed size
- Warshall's algorithm-survey and applications
- A functional, successor list based version of Warshall's algorithm with applications
- Simple rectangle-based functional programs for computing reflexive-transitive closures
- Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation.
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)
