Credit points: 3.0
This course deals with basic methods for the design and analysis of algorithms, including search methods, greedy algorithms, dynamic programming, reductions, augmenting paths. The course presents efficient algorithms for fundamental problems in graph theory and other fields. Among the topics discussed are: breadth first search, depth first search, minimum spanning tree, shortest paths, network flows and cuts.
This course deals with basic methods for the design and analysis of algorithms, including search methods, greedy algorithms, dynamic programming, reductions, augmenting paths. The course presents efficient algorithms for fundamental problems in graph theory and other fields. Among the topics discussed are: breadth first search, depth first search, minimum spanning tree, shortest paths, network flows and cuts.