Efficient graph algorithms using lazy monolithic arrays

DOI10.1017/S0956796898003062MaRDI QIDQ4236881zbMATH OpenFDO

Authors Thomas Johnsson

Publication date 28 March 1999

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

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

zbMATH Keywords

lazyArraymonolithic arrays

Mathematics Subject Classification ID

Theory of programming languages (68N15) Data structures (68P05) Parallel algorithms in computer science (68W10)

Recommendations

• Functional programming with graphs
• Inductive graphs and functional graph algorithms
• A new method for functional arrays
• scientific article; zbMATH DE number 512937
• A functional, successor list based version of Warshall's algorithm with applications

Cited in

(3)

• Inductive graphs and functional graph algorithms
• Using relations to develop a Haskell program for computing maximum bipartite matchings
• An in-situ algorithm for expanding a graph

This page was built for publication: Efficient graph algorithms using lazy monolithic arrays

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