Inductive graphs and functional graph algorithms

DOI10.1017/S0956796801004075MaRDI QIDQ2757101zbMATH OpenFDO

Authors Martin Erwig

Publication date 21 November 2001

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0956796801004075

zbMATH Keywords

functional languagesgraph algorithms

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• Functional programming with graphs
• scientific article; zbMATH DE number 512937
• Functional programming with structured graphs
• Efficient graph algorithms using lazy monolithic arrays
• scientific article; zbMATH DE number 1086663

Cited in

(12)

• Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures
• Simple rectangle-based functional programs for computing reflexive-transitive closures
• Using relations to develop a Haskell program for computing maximum bipartite matchings
• Efficient graph algorithms using lazy monolithic arrays
• scientific article; zbMATH DE number 1305093 (Why is no real title available?)
• Efficient completion of weighted automata
• Fregel: a functional domain-specific language for vertex-centric large-scale graph processing
• A computational model for generic graph functions
• Functional programming with structured graphs
• An in-situ algorithm for expanding a graph
• A functional approach to the representation of graphs
• Implementing the \(\lambda_{GT}\) language: a functional language with graphs as first-class data

This page was built for publication: Inductive graphs and functional graph algorithms

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