The following pages link to Calculating path algorithms (Q1330443):
Displaying 13 items.
- Abstract derivation of transitive closure algorithms (Q287162) (← links)
- Hopscotch -- reaching the target hop by hop (Q406451) (← links)
- Computationally efficient sup-t transitive closure for sparse fuzzy binary relations (Q812624) (← links)
- A calculational derivation of the CASOP algorithm (Q918722) (← links)
- Formal derivation of graph algorithmic programs using partition-and-recur (Q1273073) (← links)
- Deriving a class of layer-oriented graph algorithms (Q1916362) (← links)
- Dijkstra, Floyd and Warshall meet Kleene (Q1941863) (← links)
- Combining relational calculus and the Dijkstra-Gries method for deriving relational programs (Q1961862) (← links)
- Relational characterisations of paths (Q2210868) (← links)
- Components and acyclicity of graphs. An exercise in combining precision with concision (Q2667191) (← links)
- (Q4281661) (← links)
- Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems (Q5321691) (← links)
- Structural controllability of multi-agent systems with directed switching topologies (Q6660429) (← links)
