Advanced Algorithms Analysis and Design - Lecture 27: Huffman coding problem and graph theory. In this lecture we will cover the following: constructing a huffman codes; optimal substructure property; road trip problem; graph theoretic concepts; complete bipartite graph; isomorphic invariant; . |