CS 6381: Combinatorics and Graph Algorithms

                                                                    ECSS 2.312; MW 1:00--3:45


Instructor: R. Chandrasekaran

Office: ECSN 4.622 (Please Note: This is in the "old" building!!

Phone: (972) 883-2032 E-mail: [email protected]
Office Hours: W 10:00 -- 12:00.
URL: http://www.utdallas.edu/~chandra

Teaching Assistant :

Office:

email:

Class Room: ECSS 2.312: MW 1:00 -- 3:45 p.m.

Prerequisites: CS 6363 ; or consent of the instructor.

Grading Scheme

Homework and presentations (Schedule TBA)

Course Outline

  1. Graph Theory
  2. Matrices Associated with Graphs
  3. Single Commodity Maximum Flow Problem
  4. Single Commodity Multi-terminal Flows
  5. Spanning Tree Problem
  6. Shortest Path Problem
  7. Minimum Cost Flows (Example added new!!! June 25-2003)
  8. Unimodularity and Integrality
  9. Matching
  10. Blocking Systems and Polyhedra
  11.  
  12. Multicommodity Flows
  13. Matroids 
  14. Total Dual Integrality
  15. Geometry of Numbers

Assignments


Click here to go back ...