图 书 馆
第22讲：使用图形模拟问题，第2部分Lecture 22: Using Graphs to Model Problems, Part 2 |
|
| 课程网址: | http://videolectures.net/mit600SCs2011_guttag_lec22/ |
| 主讲教师: | John Guttag |
| 开课单位: | 麻省理工学院 |
| 开课时间: | 2012-10-29 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | 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. |
| 关 键 词: | 回归图论; 动态编程; 最优路径 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2019-05-22：lxf |
| 阅读次数: | 32 |