colouring

Pick anything below and it plays in the bar at the foot of the window — and keeps playing while you go on browsing the directory.

1. 1▶Discrete Optimization Lecture 15: Dynamic ProgrammingDiscrete Optimization (University of Victoria Math 428/529)Notes
   +Watch later
2. 2▶Discrete Optimization Lecture 14: List ColouringDiscrete Optimization (University of Victoria Math 428/529)Notes
   +Watch later
3. 3▶Discrete Optimization Lecture 13: Edge ColouringDiscrete Optimization (University of Victoria Math 428/529)Notes
   +Watch later
4. 4▶Discrete Optimization Lecture 12: Graph Colouring, Perfect Graphs and the Stable Set PolytopeDiscrete Optimization (University of Victoria Math 428/529)Notes
   +Watch later
5. 5▶Discrete Optimization Lecture 11: Max-Flow and Ford–Fulkerson AlgorithmDiscrete Optimization (University of Victoria Math 428/529)Notes
   +Watch later
6. 6▶Discrete Optimization Lecture 10: Matching Polytope and Network FlowsDiscrete Optimization (University of Victoria Math 428/529)Notes
   +Watch later
7. 7▶Discrete Optimization Lecture 9: Stable Marriage Problem and Tutte–Berge FormulaDiscrete Optimization (University of Victoria Math 428/529)Notes
   +Watch later
8. 8▶Discrete Optimization Lecture 8: Weighted Matching and Perfect Matching Problems in Bipartite GraphsDiscrete Optimization (University of Victoria Math 428/529)Notes
   +Watch later
9. 9▶Discrete Optimization Lecture 7: Introduction to Matchings, Kőnig's TheoremDiscrete Optimization (University of Victoria Math 428/529)Notes
   +Watch later
10. 10▶Discrete Optimization Lecture 6: Strong Duality for Linear ProgrammingDiscrete Optimization (University of Victoria Math 428/529)Notes
    +Watch later
11. 11▶Discrete Optimization Lecture 5: Linear Programming Basics and Weak DualityDiscrete Optimization (University of Victoria Math 428/529)Notes
    +Watch later
12. 12▶Discrete Optimization Lecture 4: Introduction to Linear ProgrammingDiscrete Optimization (University of Victoria Math 428/529)Notes
    +Watch later
13. 13▶Discrete Optimization Lecture 3: Reductions, hardness, NP-completeness, SAT, 3-SAT, undecidabilityDiscrete Optimization (University of Victoria Math 428/529)Notes
    +Watch later
14. 14▶Discrete Optimization Lecture 2: Decision Problems, Complexity classes. Philosophy of DualityDiscrete Optimization (University of Victoria Math 428/529)Notes
    +Watch later
15. 15▶Discrete Optimization Lecture 1: Introduction, algorithms, Big O, Shortest PathDiscrete Optimization (University of Victoria Math 428/529)Notes
    +Watch later