A study of combinatorial and graphical techniques for complexity analysis including
generating functions, recurrence relations, Polya’s theory of counting, planar directed
and undirected graphs, NP complete problems. Application of these techniques to
analysis of algorithms in graph theory.​