CS 684 Spring 2009

Graph Algorithms

Lecture Time: Wednesday 7:20pm - 10:00pm
Location: David J. King Hall 1006
Course webpage: http://www.cs.gmu.edu/~lifei/teaching/cs684_spring09/
Credit: 3

Instructor: Fei Li, Room 443, ST II, email: lifei@cs.gmu.edu
Office hours: Wednesday 5:00pm - 7:00pm



Course Overview:

This is an advanced course in the design and analysis of efficient algorithms. The emphasis is on algorithms for standard graph problems, such as minimum spanning trees, shortest paths, network flow, and maximum matching. We will also study advanced data structures, which are crucial for the more advanced topics. Randomized algorithms will also be discussed.


CS 583. Please contact with the instructor if you are not sure.

Highly Recommended Reference Books:

Algorithm Design by Jon Kleinberg and Eva Tardos, Pearson Education, Inc. (2006). (You can find the sample chapters on the webpage.)

Introduction to Algorithms by T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, The McGraw-Hill Companies, 2nd Edition (2001).

Combinatorial Optimization: Algorithms and Complexity by C. H. Papadimitriou and K. Steiglitz, Englewood Cliffs, Prentice Hall, c1982, Reprinted by Dover Books, 1998

A few recent papers.

Course Materials (Tentative):
Lectures Dates Topics Lecture Notes Scopes Notes
1 January 21 Introduction, Graph Concepts      
2 January 28 Graph Traversal Algorithms     Greedy
3 February 4

Shortest Path, Minimum Spanning Tree

4 February 11 All Pairs Shortest Path, Negative Cycles     Dynamic programming
5 February 18 Network Flows     Iterative
6 February 25 Bipartite Matching and Nonbipartite Matching     Iterative
7 March 4 Weighted Matching     Iterative
  March 11       Spring break
8 March 18       Midterm
9 March 25 Sorting Networks, Zero-One Principles      
10 April 1 NP-Complete Graph Problems, PSPACE      
11 April 8 Special Cases Analysis of Graph Problems      
12 April 15 Approximation Algorithms (TSP, Center Selection Problem, Maximum Cut, etc.)      
13 April 22 Online Algorithms (k-Server Problem, Random Walk)      
14 April 29 Randomized Algorithms (Minimum Cut, Closest Pair, etc.)      
15 May 6      

Final exam (7:30pm - 10:15pm)


Tentative Grading:

Midterm Exam (30%)

Final Exam (50%)

Assignments (20%)

Hand in hard copies of assignments in class. Please note that all coursework is to be done independently. Plagiarizing the homework will be penalized by maximum negative credit and cheating on the exam will earn you an F in the course. See the GMU Honor Code System and Policies at http://www.gmu.edu/catalog/acadpol.html and http://www.cs.gmu.edu/honor-code.html. You are encouraged to discuss the material BEFORE you do the assignment. As a part of the interaction you can discuss a meaning of the question or possible ways of approaching the solution. The homework should be written strictly by yourself. In case your solution is based on the important idea of someone else please acknowledge that in your solution, to avoid any accusations.
Academic Honesty:

The integrity of the University community is affected by the individual choices made by each of us. GMU has an Honor Code with clear guidelines regarding academic integrity. Three fundamental and rather simple principles to follow at all times are that: (1) all work submitted be your own; (2) when using the work or ideas of others, including fellow students, give full credit through accurate citations; and (3) if you are uncertain about the ground rules on a particular assignment, ask for clarification. No grade is important enough to justify academic misconduct.

Plagiarism means using the exact words, opinions, or factual information from another person without giving the person credit. Writers give credit through accepted documentation styles, such as parenthetical citation, footnotes, or endnotes. Paraphrased material must also be cited, using MLA or APA format. A simple listing of books or articles is not sufficient. Plagiarism is the equivalent of intellectual robbery and cannot be tolerated in the academic setting. If you have any doubts about what constitutes plagiarism, please see me.

Disability Statement:

If you have a learning or physical difference that may affect your academic work, you will need to furnish appropriate documentation to the Disability Resource Center. If you qualify for accommodation, the DRC staff will give you a form detailing appropriate accommodations for your instructor.

In addition to providing your professors with the appropriate form, please take the initiative to discuss accommodation with them at the beginning of the semester and as needed during the term. Because of the range of learning differences, faculty members need to learn from you the most effective ways to assist you. If you have contacted the Disability Resource Center and are waiting to hear from a counselor, please tell me.