Cited in
(13)- Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms
- An algebraic framework for minimum spanning tree problems
- A Hierarchy of Algebras for Boolean Subsets
- Relational characterisations of paths
- RelView
- First-order axiomatisations of representable relation algebras need formulas of unbounded quantifier depth
- VACID-0
- Stone Kleene
- Kleene Algebra
- KAD
- Relation Algebra
- Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras
- Verifying minimum spanning tree algorithms with Stone relation algebras
This page was built for software: Stone Algebras
