Advanced Algorithms Analysis and Design - Lecture 21: Optimal weight triangulation. In this lecture we will cover the following: observations in dual graph; proof of lemmas; correspondence to binary trees; optimal substructure; computational cost; longest common subsequence problem; dynamic programming solution; . |