An in-situ algorithm for expanding a graph

DOI10.1017/S0956796812000457MaRDI QIDQ5298792zbMATH OpenOpenAlexFDO

Authors Richard S. Bird

Publication date 14 June 2013

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

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

zbMATH Keywords

array-based algorithmHaskell library

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Functional programming and lambda calculus (68N18) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Efficient graph algorithms using lazy monolithic arrays
• scientific article; zbMATH DE number 437527
• scientific article; zbMATH DE number 5817498
• The Stanford GraphBase. A platform for combinatorial computing.
• Inductive graphs and functional graph algorithms

Cited in

(1)

• An extension of the Newman-Janis algorithm

Describes a project that uses

Uses Software

• Haskell

This page was built for publication: An in-situ algorithm for expanding a graph

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