Research of Using Dynamic Programming in the Nodes Encoding Optimization
Minyi Ke, Jie Chen, Huazhong Jin · 2009
In mathematics and computer science, dynamic programming is a method of solving complex problems by breaking them down into simpler steps. In this paper, we present a novel algorithm to select an optimal boundary node as the initial node, the selection of next node with use of dynamic planning based on the analysis of nodes encoding with the use of Cuthill-Mckee algorithm. And proper supplement is made for the network node definition in the graph theory with the combination of finite metadata calculation.