“…Supposing rung l is one of three sides of the optimal triangularization of P , and it is the optimal rung. Then the equation below is true [8] (2) with each rung in () Li and , ii , a minimum () DP could be found, and the corresponding triangularization is the optimal one. To avoid exponential processing time, this study adopted a guideline of dynamic programming presenting in (3) and (4).…”