MATH 305: Algorithm analysis: recursion, complexity; combinatorics: recurrence relations, dynamic systems, counting techniques; graph theory: Eulerian and Hamiltonian graphs, algorithms and heuristics, plana
Course Description
Algorithm analysis: recursion, complexity; combinatorics: recurrence relations, dynamic systems, counting techniques; graph theory: Eulerian and Hamiltonian graphs, algorithms and heuristics, planar graphs, trees, applications.