CSCE 423/823 lecture slides
-
Lecture 00: Administrivia and Introduction, Aug 26
(1up,
6up)
-
Lecture 01: Order Statistics, Aug 28
(1up,
6up)
-
Lecture 02: Sorting Lower Bound, Sep 10
(1up,
6up)
-
Lecture 03: Elementary Graph Algorithms, Sep 12
(1up,
6up)
-
Lecture 04: Minimum-Weight Spanning Trees, Sep 19
(1up,
6up)
-
Lecture 05: Single-Source Shortest Paths, Oct 3
(1up,
6up)
-
Lecture 06: All-Pairs Shortest Paths, Oct 8
(1up,
6up)
-
Midterm Exam, Oct 29
-
Lecture 07: Maximum Flow, Nov 5
(1up,
6up)
-
Lecture 08: NP-Completeness, Nov 14
(1up,
6up)
- See also: Computers and Intractability: A Guide to the Theory of
NP-Completeness by Michael R. Garey and David S. Johnson.
Return to the Course Home Page