CSCI148 CM - Graph Algorithms

Design and analysis of algorithms for graphs and for problems with graph-like structure. Topics may include minimum spanning trees, shortest paths, network flow, divide and conquer algorithms, greedy algorithms, dynamic programming, and complexity. Skills may include representing real-world problems as graphs, analyzing recurrences, developing new algorithms, proving algorithm correctness, analyzing time and space complexity, and reductions. This course does not count towards the computer science major.

Prerequisites: CSCI 046 CM and MATH 055 CM

Offered: Occasionally

Credit: 1

Course Number: CSCI148 CM