CS4234/CS5234 - Combinatorial and Graph Algorithms
School of Computing, National University of Singapore
(Fall Semester 2001)
Lectures (and Some Notes)
Schedule of Lectures (tentative)
Week 0: 25-July -- No Class
Overview, Outline, Prerequisites --
(link)
Learning Modes in University --
(link)
Week 1: 01-Aug -- L1: Motivation, Graph Alg, PQ
Week 2: 08-Jul -- L2: PQ, Leftist Heaps
Week 3: 15-Aug -- L3: Guest Lecture: Jurg Nievergelt
Week 4: 22-Aug -- L4: MST, LEDA Intro
Week 5: 29-Aug -- L5: Amortization, Binomial Heaps
Week 6: 05-Sep -- BREAK BREAK BREAK BREAK
Week 7: 12-Sep -- L6: Fibonacci Heaps,
Week 8: 19-Aug -- L7: Bipartite Matching
Week 9: 26-Sep -- L8: General Matching, Intro NP-Completeness
Week 10: 03-Oct -- L9: (P vs NP) and Cook's Theorem
Week 11: 10-Oct -- L10: TTP and Dealing with NPC (Approx Alg)
Week 12: 17-Oct -- L11: Local Search
Week 13: 24-Oct -- L12: Knapsack Problem
Week 13: 31-Oct -- L13: Last Lecture
Week 14: 07-Oct -- Study Week, Study Week
Week 14: 14-Oct -- Nothing... Nothing...
Week 14: 16-Nov -- Final Exam (OPEN BOOK) AM
CS4234 Lectures Page
CS4234 Home Page
