| |
Jan 28, 2025
|
|
|
|
|
CSCE 572 - Combinatorics and Geometric Algorithms 3 Credit Hour(s)
3 Lecture Hour(s) 0 Lab Hour(s)
Combinatorial mathematics and the application techniques of this area of mathematics to the optimization problems in computer science and engineering. Two major areas will be studied in this course, counting techniques and graph theory. The counting techniques will cover permutation, combination, pigeonhole principle, inclusion-exclusion principle, recurrence relation, generating function, Polya’s theorem, combinatorial design, and binomial coefficient. The graph theory will cover basic properties of finite and hyper graphs, graph coloring, Eulerian chains and cycles, Hamiltonian chains and cycles, trees, directed graphs, chromatic number, connectivity, 5-color theorem, and Euler’s formula for planar graphs.
Prereq: CMPS 341 or permission of instructor required
Add to Catalog (opens a new window)
|
|
