Simple rectangle-based functional programs for computing reflexive-transitive closures

DOI10.1007/978-3-642-33314-9_8MaRDI QIDQ2915139zbMATH OpenOpenAlexFDO

Authors Rudolf Berghammer, Sebastian Fischer

Publication date 21 September 2012

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-33314-9_8

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Functional programming and lambda calculus (68N18) Cylindric and polyadic algebras; relation algebras (03G15)

Recommendations

• Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures
• A functional, successor list based version of Warshall's algorithm with applications
• Abstract derivation of transitive closure algorithms
• Functional Kleene Closures
• scientific article; zbMATH DE number 1953900

Cites work

• scientific article; zbMATH DE number 4086991 (Why is no real title available?)
• scientific article; zbMATH DE number 1210362 (Why is no real title available?)
• scientific article; zbMATH DE number 512937 (Why is no real title available?)
• scientific article; zbMATH DE number 234018 (Why is no real title available?)
• A Theorem on Boolean Matrices
• A functional, successor list based version of Warshall's algorithm with applications
• Computer Algebra in Scientific Computing
• Deriving a class of layer-oriented graph algorithms
• Deriving relational programs for computing kernels by reconstructing a proof of Richardson's theorem
• Functional programming with graphs
• Gaussian elimination is not optimal
• Implementing relational specifications in a constraint functional logic language
• Inductive graphs and functional graph algorithms
• New Bounds on the Complexity of the Shortest Path Problem
• On automated program construction and verification
• On computing representatives
• Rectangles, Fringes, and Inverses
• Relational depth-first-search with applications
• Semigroupoid Interfaces for Relation-Algebraic Programming in Haskell
• The integration of functions into logic programming: From theory to practice
• Two graph algorithms derived
• Using relations to develop a Haskell program for computing maximum bipartite matchings

Cited in

(3)

• A functional, successor list based version of Warshall's algorithm with applications
• Abstract derivation of transitive closure algorithms
• Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures

Describes a project that uses

Uses Software

• Algorithm 97
• TituRel
• Haskell
• RelView

This page was built for publication: Simple rectangle-based functional programs for computing reflexive-transitive closures

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