CSC 205 - Algorithms II: Combinatorial Algorithms

Once a year
String and pattern matching algorithms. Maximum flow. Other graph algorithms: spanning trees, shortest path, transitive closure, biconnectivity, strong connectivity, and the like. Fast median algorithm. Fast matrix multiplication. Fast matrix inversion.

Prerequisites & Notes
CSC 120.

Credits: 3 s.h.

View Course Offering(s):