A Functional, Successor List Based Version of Warshall’s Algorithm with Applications

DOI10.1007/978-3-642-21070-9_10zbMath1329.68303OpenAlexW187006239MaRDI QIDQ3007572

Rudolf Berghammer

Publication date: 17 June 2011

Published in: Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21070-9_10

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Functional programming and lambda calculus (68N18) Cylindric and polyadic algebras; relation algebras (03G15)

Related Items (4)

Towards Certifiable Implementation of Graph Transformation via Relation Categories ⋮ Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closures ⋮ Using Relations to Develop a Haskell Program for Computing Maximum Bipartite Matchings ⋮ Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures

Uses Software

• RelView
• Haskell
• TituRel

This page was built for publication: A Functional, Successor List Based Version of Warshall’s Algorithm with Applications