CS 4440 Textbook Lecture Slides

• Demonstration of The Gale-Shapley Algorithm (PowerPoint Download)
  
  
• 1.1 A First Problem: Stable Matching (PDF)
  
  
• 1.1 A First Problem: Stable Matching (PowerPoint Download)
  
  
• Topological Ordering Example (PowerPoint Download)
  
  
• Graphs: 3.1 Basic Definitions and Applications (PDF)
  
  
• Graphs: 3.1 Basic Definitions and Applications (PowerPoint Download)
  
  
• Dijkstra's Shortest Path Algorithm Demonstration (PowerPoint Download)
  
  
• Interval Scheduling Algorithm Demonstration (PowerPoint Download)
  
  
• Greedy Algorithms, 4.1-4.4 (PDF)
  
  
• Greedy Algorithms, 4.1-4.4 (PowerPoint Download)
  
  
• Greedy Algorithms, 4.5-4.7 (PDF)
  
  
• Greedy Algorithms, 4.5-4.7 (PowerPoint Download)
  
  
• Merging Demonstration (PowerPoint Download)
  
  
• Merge and Count Demonstration (PowerPoint Download)
  
  
• Divide and Conquer Algorithms, 5.1-5.5 (PDF)
  
  
• Divide and Conquer Algorithms, 5.1-5.5 (PowerPoint Download)
  
  
• Dynamic Programming Algorithms, 6.1-6.7 (PDF)
  
  
• Dynamic Programming Algorithms, 6.1-6.7 (PowerPoint Download)
  
  
• Ford-Fulkerson Algorithm Demonstration (PowerPoint Download)
  
  
• Max Flow Applications, 7.1-7.3 (PDF)
  
  
• Max Flow Applications, 7.1-7.3 (PowerPoint Download)
  
  
• Max Flow Applications, 7.5-7.12 (PDF)
  
  
• Max Flow Applications, 7.5-7.12 (PowerPoint Download)
  
  
• NP and Computational Intractability, 8.1-8.2 (PDF)
  
  
• NP and Computational Intractability, 8.1-8.2 (PowerPoint Download)
  
  
• NP and Computational Intractability, 8.3-8.4, 8.9 (PDF)
  
  
• NP and Computational Intractability, 8.3-8.4, 8.9 (PowerPoint Download)
  
  
• NP and Computational Intractability, 8.5-8.8, 8.10 (PDF)
  
  
• NP and Computational Intractability, 8.5-8.8, 8.10 (PowerPoint Download)