Modelling dynamic programming problems by generalized d-graphs

Details Modelling dynamic programming problems by generalized d-graphs Modelling dynamic programming problems by generalized d-graphs

2010-11-30

arxiv.org/abs/1012.0058v1

Acta Univ. Sapientiae Informatica, vol. 2 no. 2 (2010) 210-230

Computer Science

Data Structures and Algorithms

Scientific paper

In this paper we introduce the concept of generalized d-graph (admitting cycles) as special dependency-graphs for modelling dynamic programming (DP) problems. We describe the d-graph versions of three famous single-source shortest algorithms (The algorithm based on the topological order of the vertices, Dijkstra algorithm and Bellman-Ford algorithm), which can be viewed as general DP strategies in the case of three different class of optimization problems. The new modelling method also makes possible to classify DP problems and the corresponding DP strategies in term of graph theory.

Affiliated with

Also associated with

No associations

Rating

Modelling dynamic programming problems by generalized d-graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Modelling dynamic programming problems by generalized d-graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modelling dynamic programming problems by generalized d-graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-574245