CS170: Efficient Algorithms and Intractable Problems (Berkeley)

Berkeley CS170: Efficient Algorithms and Intractable Problems

Guide

All

01-Introduction
01-Introduction
02-Divide-and-Conquer (Part I)
02-Divide-and-Conquer (Part I)
03-Divide-and-Conquer (Part II)
03-Divide-and-Conquer (Part II)
04-Divide-and-Conquer (Part III)
04-Divide-and-Conquer (Part III)
05-Decomposition of Graphs
05-Decomposition of Graphs
06-Paths in Graphs (Part I)
06-Paths in Graphs (Part I)
07-Paths in Graphs (Part II)
07-Paths in Graphs (Part II)
08-Greedy (Part I)
08-Greedy (Part I)
09-Greedy (Part II)
09-Greedy (Part II)
10-Greedy (Part III)
10-Greedy (Part III)
11-Greedy Wrap-Up and Introduction to Dynamic Programming
11-Greedy Wrap-Up and Introduction to Dynamic Programming
12-Dynamic Programming (Part II)
12-Dynamic Programming (Part II)
13-Dynamic Programming (Part III)
13-Dynamic Programming (Part III)
14-Dynamic Programming (Part IV)
14-Dynamic Programming (Part IV)
15-Linear Programming
15-Linear Programming
16-Network Flow + Bipartite Matching
16-Network Flow + Bipartite Matching
17-Duality, Zero-Sum Games
17-Duality, Zero-Sum Games
18-P vs NP
18-P vs NP
19-P vs NP (Part II)
19-P vs NP (Part II)

Winda

DFS search trees, edge classification, cycle detection, topological sorting, and Kosaraju–Sharir’s algorithm for strongly connected components.DFS search trees, edge classification, cycle detection, topological sorting, and Kosaraju–Sharir’s algorithm for strongly connected components.

Save to open this file