CSCE 423/823 lecture slides
-
Lecture 00: Administrivia and Introduction, Aug 25
(1up,
6up)
-
Lecture 01: Quick Review of Background, Aug 27–Sep 1
(1up,
6up)
-
Lecture 02: Elementary Graph Algorithms, Sep 1–3
(1up,
6up)
-
Lecture 03: Greedy Algorithms, Sep 8–15
(1up,
6up)
-
Lecture 04: Minimum-Weight Spanning Trees, Sep 15–24
(1up,
6up)
-
Lecture 05: Single-Source Shortest Paths, Sep 29–Oct 6
(1up,
6up)
-
Lecture 06: Dynamic Programming, Oct 8–15
(1up,
6up)
-
Fall Break, Oct 20
-
Midterm Exam Review, Oct 22
-
Midterm Exam, Oct 27
-
Lecture 07: All-Pairs Shortest Paths, Oct
29–Nov 5
(1up,
6up)
-
Lecture 08: Lower Bounds,
Nov 5–12
(1up,
6up)
-
Lecture 09: NP-Completeness, Nov 17–Dec 3
(1up,
6up)
-
Thanksgiving, Nov 26
-
Lecture 10: Maximum Flow, Dec 8–10
(1up,
6up)
-
Final Exam Review, Dec 10
-
Course Evaluations, Dec 10 BRING A MOBILE DEVICE
-
Final Exam, Dec 16, 10:00am–12:00pm
Return to the Course Home Page