Calculating path algorithms
From MaRDI portal
Publication:1330443
DOI10.1016/0167-6423(94)90005-1zbMath0818.68117OpenAlexW2054262476MaRDI QIDQ1330443
A. J. M. van Gasteren, J. P. H. W. van den Eijnde, Roland C. Backhouse
Publication date: 21 July 1994
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6423(94)90005-1
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items (8)
Abstract derivation of transitive closure algorithms ⋮ Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems ⋮ Components and acyclicity of graphs. An exercise in combining precision with concision ⋮ Dijkstra, Floyd and Warshall meet Kleene ⋮ Relational characterisations of paths ⋮ Combining relational calculus and the Dijkstra-Gries method for deriving relational programs ⋮ Formal derivation of graph algorithmic programs using partition-and-recur ⋮ Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
This page was built for publication: Calculating path algorithms
