Calculating path algorithms

DOI10.1016/0167-6423(94)90005-1zbMATH Open0818.68117OpenAlexW2054262476MaRDI QIDQ1330443FDOQ1330443

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

zbMATH Keywords

algebra of regular languagespath algorithms

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Cited In (10)

• Combining relational calculus and the Dijkstra-Gries method for deriving relational programs
• Formal derivation of graph algorithmic programs using partition-and-recur
• Abstract derivation of transitive closure algorithms
• Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
• Dijkstra, Floyd and Warshall meet Kleene
• Relational characterisations of paths
• Components and acyclicity of graphs. An exercise in combining precision with concision
• Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems
• Structural controllability of multi-agent systems with directed switching topologies
• Title not available (Why is that?)

Recommendations

• Computing almost shortest paths 👍 👎
• Algorithms to count paths and cycles 👍 👎
• Algorithms for long paths in graphs 👍 👎
• Calculating Graph Algorithms for Dominance and Shortest Path 👍 👎
• Path Algorithms on Regular Graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Calculating path algorithms

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