Pages that link to "Item:Q2347907"
From MaRDI portal
The following pages link to Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures (Q2347907):
Displaying 4 items.
- An algebraic framework for minimum spanning tree problems (Q1786562) (← links)
- Verifying minimum spanning tree algorithms with Stone relation algebras (Q1994364) (← links)
- Relational characterisations of paths (Q2210868) (← links)
- Relation-Algebraic Verification of Prim’s Minimum Spanning Tree Algorithm (Q3179390) (← links)
