Optimization circuits for the Bellman–Ford computation algorithm

Optimization circuits for the Bellman–Ford computation algorithm

0.00 Avg rating0 Votes
Article ID: iaor19982971
Country: United States
Volume: 30
Issue: 19
Start Page Number: 1584
End Page Number: 1586
Publication Date: Oct 1994
Journal: Electronics Letters
Authors: ,
Keywords: programming: dynamic
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.

Reviews

Required fields are marked *. Your email address will not be published.