Pages that link to "Item:Q2253612"
From MaRDI portal
The following pages link to Computing tournament solutions using relation algebra and RelView (Q2253612):
Displaying 8 items.
- Control of Condorcet voting: complexity and a relation-algebraic approach (Q319803) (← links)
- Computing minimal extending sets by relation-algebraic modeling and development (Q406434) (← links)
- Spatial voting games, relation algebra and RelView (Q406437) (← links)
- An algebraic framework for minimum spanning tree problems (Q1786562) (← links)
- Verifying minimum spanning tree algorithms with Stone relation algebras (Q1994364) (← links)
- Relation-algebraic verification of Borůvka's minimum spanning tree algorithm (Q2695356) (← links)
- Relation-Algebraic Verification of Prim’s Minimum Spanning Tree Algorithm (Q3179390) (← links)
- Stone Relation Algebras (Q5283207) (← links)
