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.
Here is the most recent CS 530 Course News.
Here is the current homework, HW1 (Ford-Fulkerson) .
And here is the example of the Ford Fulkerson method on a small input graph which we went through in class on Tuesday, September 12.
Here are past homeworks: hw0.
Here you can find some brief homework solutions:
Here is an overview of course policy.
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