CMSC 453 - Applied Combinatorics and Graph Theory (3)

An introduction to the application of combinatorial methods to computer science. Topics include enumeration methods, recurrence relations, generating functions, graph theory and graph algorithms, and connectivity, Euler tours, Hamiltonian cycles, flow graphs and transport networks, matching theory, planarity, Kuratowski’s theorem and NP-complete combinatorial problems.

Grading: Graded/Satisfactory Unsatisfactory/Audit
Course ID: 52949
Consent: No Special Consent Required
Components: Lecture
Prerequisite: CMSC 341, MATH 221, and (MATH 142 or MATH 152) with a grade of ‘C’ or better.