CS5234 - Combinatorial and Graph Algorithms
School of Computing, National University of Singapore
(Fall Semester 2007)

Lectures Schedule

Schedule of Lectures

  • Week 0: 07-Aug-2007 -- Course Briefing (1.0 hr) | Overview (ppt)
  • Week 1: 14-Aug-2007 -- L01: Quick Review (Motivation, AA, Randomized Quicksort, D&C)
  • Week 2: 21-Aug-2007 -- L02: Quick Review II (DS, Dynamic Programming, Greedy Algorithms)
  • Week 3: 28-Aug-2007 -- L03: Priority Queues, Anmortized Analysis
  • Week 4: 04-Sep-2007 -- L04: Binomial Heaps and LEDA
  • Week 5: 11-Sep-2007 -- L05: PSA Guest Lecture and Fibonacci Heaps
  • Week 6: 18-Sep-2007 -- L06: Fibonacci Heaps, BAP, Graph Partitioning
  • BREAK: 25-Sep-2007 -- L07: [Makeup for 2-Oct] BAP Project & Graph Partitioning II

  • Week 7: 02-Oct-2007 -- No lecture (* on conference leave *)

  • Week 8: 09-Oct-2007 -- L08: Network Flows and Applications

  • Week 9: 16-Oct-2007 -- L09: Matching and Applications

  • Week 10: 23-Oct-2007 -- L10: Problem Reduction, NP-completeness

  • Week 11: 30-Oct-2007 -- L11: P, NP, NPC and Cook's Theorem, NP-completeness proofs

  • Week 12: 06-Nov-2007 -- L12: Approximation Algorithms

  • Week 13: 13-Nov-2007 -- L13: Meta-Heuristic Search Algorithms (*Last Lecture*)

  • STUDY WEEK

  • Week xx: 04-Dec-2007 -- Final Exam (OPEN BOOK) PM

    • CS4234 Lectures Page
    CS4234 Home Page