Feb 10, 2025  
2015-2016 Undergraduate Catalog 
    
Catalog Navigation
  Catalog Home
  Academic Programs
  Course Descriptions
  Undergraduate Degree Requirements
  Academic Standards and Administrative Requirements
  Academic Resources
  Special Opportunities
  The First-Year Experience
  Life on the UMBC Campus
  Division of Professional Studies
  Admission to UMBC
  Transfer Credit Policies, AP, CLEP, IB, and UMBC Administered Examinations
  Tuition and Fees
  Paying for College
  Faculty
  Archived Catalogs
  Rights and Regulations
  My Portfolio
HELP
2015-2016 Undergraduate Catalog [ARCHIVED CATALOG]

Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
Add to Portfolio (opens a new window)

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.


Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
Add to Portfolio (opens a new window)