Calculating path algorithms
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 512947
- scientific article; zbMATH DE number 3917709
- Algorithms to count paths and cycles
- Path Algorithms on Regular Graphs
- Shortest path algorithms
- scientific article; zbMATH DE number 3937196
- Algorithms for long paths in graphs
- Calculating graph algorithms for dominance and shortest path
- Computing almost shortest paths
Cited in
(16)- Components and acyclicity of graphs. An exercise in combining precision with concision
- Calculating graph algorithms for dominance and shortest path
- scientific article; zbMATH DE number 512947 (Why is no real title available?)
- Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
- Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems
- A calculational derivation of the CASOP algorithm
- Path Algorithms on Regular Graphs
- Abstract derivation of transitive closure algorithms
- Hopscotch -- reaching the target hop by hop
- Relational characterisations of paths
- Dijkstra, Floyd and Warshall meet Kleene
- Warshall's algorithm-survey and applications
- Abstract interpretation of graphs
- Combining relational calculus and the Dijkstra-Gries method for deriving relational programs
- Formal derivation of graph algorithmic programs using partition-and-recur
- Structural controllability of multi-agent systems with directed switching topologies
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)
