CSCE 423/823 lecture slides
-
Lecture 00: Administrivia and Introduction, Jan 14
(1up,
6up)
-
Lecture 01: Order Statistics, Jan 16
(1up,
6up)
-
Lecture 02: Sorting Lower Bound, Jan 28
(1up,
6up)
-
Lecture 03: Elementary Graph Algorithms, Feb 4
(1up,
6up)
-
Lecture 04: Minimum-Weight Spanning Trees, Feb 13
(1up,
6up)
-
Lecture 05: Single-Source Shortest Paths, Feb 20
(1up,
6up)
-
Lecture 06: All-Pairs Shortest Paths, Mar 6
(1up,
6up)
-
Midterm Exam Review, Mar 18
-
Midterm Exam, Mar 20
-
Spring Break, Mar 25–27
-
Lecture 07: NP-Completeness, Apr 1
(1up,
6up)
- See also: Computers and Intractability: A Guide to the Theory of
NP-Completeness by Michael R. Garey and David S. Johnson.
-
Lecture 08: Maximum Flow, Apr 15
(1up,
6up)
Return to the Course Home Page