Work

Modelling dynamic programming problems by generalized d-graphs

Year: 2010

Type: preprint

Abstract: 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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1012.0058

Author: Kátai, Zoltán

Institutions: St. Thomas University, Sapientia Hungarian University of Transylvania

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Universitatea Sapientia

OpenAlex ID: W1483949697

Cites: 13

Cited by: 2

Related to: 10