Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closures
From MaRDI portal
Publication:2915139
DOI10.1007/978-3-642-33314-9_8zbMath1330.68044OpenAlexW206758492MaRDI QIDQ2915139
Sebastian Fischer, Rudolf Berghammer
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
Functional programming and lambda calculus (68N18) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Cylindric and polyadic algebras; relation algebras (03G15)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On computing representatives
- Deriving relational programs for computing kernels by reconstructing a proof of Richardson's theorem
- Relational depth-first-search with applications
- Two graph algorithms derived
- Deriving a class of layer-oriented graph algorithms
- Gaussian elimination is not optimal
- Inductive graphs and functional graph algorithms
- Implementing Relational Specifications in a Constraint Functional Logic Language
- Using Relations to Develop a Haskell Program for Computing Maximum Bipartite Matchings
- A Functional, Successor List Based Version of Warshall’s Algorithm with Applications
- Rectangles, Fringes, and Inverses
- On Automated Program Construction and Verification
- New Bounds on the Complexity of the Shortest Path Problem
- The integration of functions into logic programming: From theory to practice
- Functional programming with graphs
- Semigroupoid Interfaces for Relation-Algebraic Programming in Haskell
- Computer Algebra in Scientific Computing
- A Theorem on Boolean Matrices
This page was built for publication: Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closures
