Once a year
Study of combinatorial and graphical techniques for complexity analysis including
generating functions, recurrence relations, Polya’s theory of counting, planar
directed and undirected graphs, and NP-complete problems. Applications of the
techniques to analysis of algorithms in graph theory, and sorting and searching.