Relational Forests
From MaRDI portal
- Combining relational calculus and the Dijkstra-Gries method for deriving relational programs
- On automated program construction and verification
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Second-order properties of undirected graphs
- Sur l'extension de l'ordre partiel.
- Verifying minimum spanning tree algorithms with Stone relation algebras
This page was built for software: Relational Forests
