Pages that link to "Item:Q1786562"
From MaRDI portal
The following pages link to An algebraic framework for minimum spanning tree problems (Q1786562):
Displaying 11 items.
- On symbolic OBDD-based algorithms for the minimum spanning tree problem (Q443706) (← links)
- Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms (Q832310) (← links)
- Verifying minimum spanning tree algorithms with Stone relation algebras (Q1994364) (← links)
- Relational characterisations of paths (Q2210868) (← links)
- An axiomatic approach in minimum cost spanning tree problems with groups (Q2348765) (← 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)
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (Q5865336) (← links)
- Algorithms for computing the folk rule in minimum cost spanning tree problems with groups (Q6110599) (← links)
- Relation-algebraic verification of disjoint-set forests (Q6614547) (← links)