CS6204 - Combinatorial and Graph Algorithms
School of Computing, National University of Singapore
(Semester 1 (Fall) 2000)
Lectures (and Some Notes)
Schedule of Lectures (tentative)
Week 0: 11-July -- Overview, Outline, Prerequisites --
(link)
Week 1: 18-Jul -- Motivation, Graph Alg, PQ, Leftist Heaps --
(gif)
Week 2: 25-Jul -- Leftist Heaps, Fast MST Algorithm --
(gif)
Week 3: 01-Aug -- LEDA Intro and Amortization --
(gif)
Week 4: 08-Aug -- Binomial Heaps, Fibonacci Heaps
Week 5: 15-Aug -- Bipartite Matching and Applications
Week 6: 22-Aug -- General Matching, Network Flows
Week 7: 29-Aug -- Network Flows, NP-Completeness
Week 8: 05-Sep -- BREAK BREAK BREAK BREAK
Week 9: 12-Sep -- Cook's Theorem, Dealing with NPC
Week 10: 19-Sep --
Week 11: 26-Sep --
Week 12: 03-Oct --
Week 13: 10-Oct --
Week 14: 17-Oct -- Last Lecture
Week 14: 24-Oct -- Study Week, Study Week
Week 14: 31-Oct -- Nothing... Nothing...
Week 14: 07-Nov -- Final Exam 6:30pm-8:30pm (OPEN BOOK) @TR5
CS6204 Lectures Page
CS6204 Home Page
