Algorithms

Max-Flow, NP-Completeness, Backtracking & Branch and Bound

Four advanced topics: pushing maximum flow through a network (Ford-Fulkerson, Edmonds-Karp), the theory of intractability (P, NP, NP-Complete, NP-Hard), solving constraint problems by backtracking (permutations, N-Queens), and pruning huge search spaces with branch and bound (the Travelling Salesman Problem).

Topics

Maximum Flow: Ford-Fulkerson Method

Edmonds-Karp Algorithm

Theory of NP-Completeness

Backtracking: Permutations

Backtracking: N-Queens Problem

Branch and Bound: Travelling Salesman Problem