CS6204 - Combinatorial and Graph Algorithms
School of Computing, National University of Singapore
(Semester 1 (Fall) 1999)
Lectures (and Some Notes)
Schedule of Lectures (tentative)
Week 0: 13-July -- Overview, Outline, Prerequisites --
(pdf)
Week 1: 20-Jul -- Quick Review, PQ, Faster Shortest Path Alg --
(gif)
Week 2: 27-Jul -- Leftist Heaps and Fast MST Algorithm --
(gif)
Week 3: 03-Aug -- Fast MST Analysis, Amortization --
(gif)
Week 4: 10-Aug -- Binomial Heaps, Fibonacci Heaps
Week 5: 17-Aug -- LEDA -- An Introduction
Week 6: 24-Aug -- Matching & Bipartite Matching Algorithms
Week 7: 31-Aug -- Applications of Matching, General Matching, TSP
Week 8: 07-Sep -- BREAK BREAK BREAK BREAK
Week 9: 14-Sep -- Convocation Dinner;
Rescheduled: Thu, 16-Sept
Week 10: 21-Sep --
Week 11: 28-Sep --
Week 12: 05-Oct --
Week 13: 12-Oct --
Week 14: 19-Oct -- Last Lecture
Week 14: 26-Oct -- Study Week, Study Week
Week 14: 02-Oct -- Nothing... Nothing...
Week 14: 09-Oct -- Final Exam 6:30pm
CS6204 Lectures Page
CS6204 Home Page
