Pages that link to "Item:Q1994364"
From MaRDI portal
The following pages link to Verifying minimum spanning tree algorithms with Stone relation algebras (Q1994364):
Displaying 8 items.
- Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms (Q832310) (← links)
- Relational characterisations of paths (Q2210868) (← links)
- Second-order properties of undirected graphs (Q2695354) (← links)
- Relation-algebraic verification of Borůvka's minimum spanning tree algorithm (Q2695356) (← links)
- Reasoning About Algebraic Structures with Implicit Carriers in Isabelle/HOL (Q5049005) (← links)
- Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras (Q5098718) (← links)
- A Hierarchy of Algebras for Boolean Subsets (Q5098719) (← links)
- FIRST-ORDER AXIOMATISATIONS OF REPRESENTABLE RELATION ALGEBRAS NEED FORMULAS OF UNBOUNDED QUANTIFIER DEPTH (Q5100063) (← links)
