Welcome to the home page for the Computer Science Department's Graduate Algorithms course CLA CS 530. This is the starting point for online course information and documentation.
Quiz 1 with brief answers, Quiz 2 with brief answers.
-Example of the Ford Fulkerson method on a small input graph which we went through in class
-Reading on randomized algorithms .
-An example of the edge contraction algorithm to find a min-cut in a graph (with high probability).
Applications of graph matching problems, and of max-flow techniques.
HW 1, HW 2.
CS 530 is the central graduate algorithms course in the computer science curriculum. It serves as the a core graduate theory course. It is the successor to the undergraduate algorithms course, CS 330, and has this course as a prerequisite. In CS 530 students will learn fundamental algorithm design and algorithm analysis at the graduate level. The following list of pointers provides access to information concerning the course, the students and the instructors.
Page prepared by Steve Homer