Lecture 22: Using Graphs to Model Problems, Part 2
recorded by: Massachusetts Institute of Technology, MIT
published: Oct. 29, 2012, recorded: April 2011, views: 2242
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
This lecture returns to graph theory. It defines and gives examples of some classic graph problems: shortest path, shortest weighted path, cliques, and min-cut. It then shows how memoization can be used to speed up some algorithms.
Topics covered: Dynamic programming, optimal path, overlapping subproblems, weighted edges, specifications, restrictions, efficiency, pseudo-polynomials.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !