Title :
Optimisation circuits for the Bellman-Ford computation algorithm
Author_Institution :
Dept. of Syst. Eng., Chinese Univ. of Hong Kong, Shatin
fDate :
9/15/1994 12:00:00 AM
Abstract :
The Bellman-Ford algorithm is well known for providing a dynamic programming solution for the shortest path problem. The authors describe some novel optimisation circuits which incorporate the Bellman-Ford algorithm for solving closed semi-ring problems, with particular reference to the minimum spanning tree problem
Keywords :
analogue computer circuits; dynamic programming; minimisation; trees (mathematics); Bellman-Ford computation algorithm; closed semi-ring problems; dynamic programming; minimum spanning tree problem; optimisation circuits; shortest path problem;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19941077
