CSCI 274 - Combinatorial Algorithms

Prerequisite: CSCI 174 or permission of instructor
Design and analysis of efficient algorithms for combinatorial problems. Network flow theory, matching theory, augmenting-path algorithms, branch-and-bound algorithms, data structure techniques for efficient implementation of combinatorial algorithms, analysis of data structures, application of data structural techniques to sorting, searching, and geometric problems.

Units: 3

Course Typically Offered: Fall