### Abstract

We verify the correctness of Prim's, Kruskal's and Borůvka's minimum spanning tree algorithms based on algebras for aggregation and minimisation.

### License

BSD License

### Topics

- Computer science/Algorithms/Graph

### Session Relational_Minimum_Spanning_Trees

- Kruskal
- Prim
- Boruvka

### Depends on

- Relational Disjoint-Set Forests

## Cite

×

Relational_Minimum_Spanning_Trees-AFP

    @article{Relational_Minimum_Spanning_Trees-AFP,
      author  = {Walter Guttmann and Nicolas Robinson-O'Brien},
      title   = {Relational Minimum Spanning Tree Algorithms},
      journal = {Archive of Formal Proofs},
      month   = {December},
      year    = {2020},
      note    = {\url{https://isa-afp.org/entries/Relational_Minimum_Spanning_Trees.html},
                 Formal proof development},
      ISSN    = {2150-914x},
    }

Download

## Download

× Download latest

Older releases:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Dec 14, 2021 : Isabelle2021-1
- Feb 23, 2021 : Isabelle2021
- Dec 8, 2020 : Isabelle2020