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.

I have scanned and posted the example of the Ford-Fulkerson Maxflow algorithm which we have been working on in class the last couple of days. It is two pages. The first page contains the execution of the basic algorithm on the example graph. The second is an example of how the successive flows we have found can be "added together" to get the max flow.

Here is the current homework, HW3.

Here are past homeworks and quizzes: quiz 0 , Homework 1, this homework has uses a graph for problem 1 which can be found here, quiz 2, Homework 2.

Here you can find some solutions for hw1.

*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.

- Course Information
- Computer Science Department Information
- Help and Other Places in Cyberspace (courtesy of A. Kfoury)
- A Historical Note
- Steve Seiden's Cheat Sheet(ten pages of commonly used formulas in computer science).

Page prepared by Steve Homer