Relation-algebraic verification of Prim's minimum spanning tree algorithm
From MaRDI portal
Recommendations
- An algebraic framework for minimum spanning tree problems
- Verifying minimum spanning tree algorithms with Stone relation algebras
- scientific article; zbMATH DE number 2013597
- scientific article; zbMATH DE number 1210360
- Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 1210360 (Why is no real title available?)
- scientific article; zbMATH DE number 475188 (Why is no real title available?)
- scientific article; zbMATH DE number 977284 (Why is no real title available?)
- scientific article; zbMATH DE number 1086633 (Why is no real title available?)
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- scientific article; zbMATH DE number 2013597 (Why is no real title available?)
- scientific article; zbMATH DE number 234018 (Why is no real title available?)
- scientific article; zbMATH DE number 3245483 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- scientific article; zbMATH DE number 3366941 (Why is no real title available?)
- A completeness theorem for Kleene algebras and the algebra of regular events
- A linear algebra approach to OLAP
- A new algebraic approach to L-fuzzy relations convenient to study crispness
- A note on two problems in connexion with graphs
- Abstract abstract reduction
- C-semiring Frameworks for Minimum Spanning Tree Problems
- Categorical representation theorems of fuzzy relations
- Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures
- Computing tournament solutions using relation algebra and RelView
- Crispness in Dedekind categories
- Dijkstra, Floyd and Warshall meet Kleene
- Extended Static Checking by Calculation Using the Pointfree Transform
- Extending Sledgehammer with SMT solvers
- Graphs, dioids and semirings. New models and algorithms.
- Isabelle/HOL. A proof assistant for higher-order logic
- L-fuzzy sets
- Lattices and ordered algebraic structures
- On the Cardinality of Relations
- Relation-algebraic semantics
- Relational style laws and constructs of linear algebra
- The saga of minimum spanning trees
- The verified incremental design of a distributed spanning tree algorithm: Extended abstract
- Towards a linear algebra of programming
- Weighted automata as coalgebras in categories of matrices
- Winskel is (almost) right: Towards a mechanized semantics textbook
Cited in
(9)- Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms
- scientific article; zbMATH DE number 2013597 (Why is no real title available?)
- Verifying minimum spanning tree algorithms with Stone relation algebras
- Relational characterisations of paths
- Relation-algebraic verification of Borůvka's minimum spanning tree algorithm
- An algebraic framework for minimum spanning tree problems
- Pseudocomplementation and minimal prime ideals in semirings
- scientific article; zbMATH DE number 7649972 (Why is no real title available?)
- Stone relation algebras
Describes a project that uses
Uses Software
This page was built for publication: Relation-algebraic verification of Prim's minimum spanning tree algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179390)
