scientific article; zbMATH DE number 2013597

MaRDI QIDQ4436983zbMATH OpenFDO

Authors Dominique Cansell, Dominique Mery, Jean-Raymond Abrial

Publication date 4 December 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2651/26510457.htm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• An algebraic framework for minimum spanning tree problems
• Relation-algebraic verification of Prim's minimum spanning tree algorithm
• scientific article; zbMATH DE number 1210360
• The verified incremental design of a distributed spanning tree algorithm: Extended abstract
• Computational Methods for Minimum Spanning Tree Algorithms

Cited in

(9)

• An algebraic framework for minimum spanning tree problems
• Verifying minimum spanning tree algorithms with Stone relation algebras
• Relation-algebraic verification of Prim's minimum spanning tree algorithm
• scientific article; zbMATH DE number 1210360 (Why is no real title available?)
• Incremental parametric development of greedy algorithms
• scientific article; zbMATH DE number 7649972 (Why is no real title available?)
• Purely Functional, Simple, and Efficient Implementation of Prim and Dijkstra
• Priority Search Trees
• Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4436983)