CS 6381-001: Combinatorics and Graph Algorithms

                                FALL 2021: TR: 10:00 -- 11:15 a.m. ECSN: 2.112(HYBRID)


Instructor: R. Chandrasekaran

Office: ECSS 4.611

Phone: (972) 883-2032

E-mail: chandra AT utdallas DOT edu


Office Hours: M: 1:30 -- 3:00


URL: http://www.utdallas.edu/~chandra

Teaching Assistant :

Office hours and Office:

email:

Prerequisites: CS 6363 ; or consent of the instructor.

Instructions for this course

Audio/Video Files

Lecture#1

Lecture#2

Lecture#3

Lecture#4

Lecture#5

Lecture#6

Lecture#7

Lecture#8

Lecture#9

Lecture#10

Lecture#11

Lecture#12

Lecture#13

Lecture#14

Lecture#15

Lecture#16

Lecture#17

Lecture#18

Lecture#19

Lecture#20

Lecture#21

Lecture#22

Lecture#22B

Lecture#23

Lecture#24

Lecture#25

Lecture#26

Lecture#27

Lecture#28

Lecture#29

Lecture#30

Lecture#31

Lecture#32

 

 

 

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