Lecture 22: Using Graphs to Model Problems, Part 2
author: John Guttag,
Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, MIT
recorded by: Massachusetts Institute of Technology, MIT
published: Oct. 29, 2012, recorded: April 2011, views: 2245
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)
recorded by: Massachusetts Institute of Technology, MIT
published: Oct. 29, 2012, recorded: April 2011, views: 2245
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)
Related content
Report a problem or upload files
If 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.
Description
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 page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !
Write your own review or comment: