CMSC 453 - Applied Combinatorics and Graph Theory

(3.00)

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.

Course ID: 52949
Consent: No Special Consent Required
Components: Lecture
Requirement Group: You must complete CMSC 341 and MATH 221 and MATH 152 or MATH 142 with a C or better.