BSCS4021 · Knowledge Base
Advanced Algorithms Notes
13
Concepts
0
Facts
0
Procedures
concept
1m
421 - Greedy Algorithms
concept
1m
422 - Matroid Theory — Definition, Examples, Greedy Algorithm on Matroids
concept
1m
423 - Dynamic Programming
concept
1m
424 - Network Flow — Ford-Fulkerson, Max-Flow Min-Cut, Applications
concept
1m
425 - Applications of Network Flow
concept
1m
426 - String Algorithms — KMP, Rabin-Karp, and Pattern Matching
concept
1m
427 - NP-Completeness — P, NP, NP-Hard, Reductions
concept
1m
428 - Approximation Algorithms
concept
1m
429 - Randomized Algorithms
concept
1m
430 - Advanced Data Structures — Segment Trees, Fenwick Trees, Disjoint Sets
concept
1m
431 - Exact Algorithms — Branch & Bound, DP for TSP, Local Search
concept
1m
432 - Online and Parallel Algorithms
concept
1m