- http://jeffe.cs.illinois.edu/teaching/algorithms/book/02-backtracking.pdf
- https://medium.com/@andreaiacono/backtracking-explained-7450d6ef9e1a
- Backtracking: https://www.youtube.com/watch?v=DKCbsiDBN6c
- Sum of Subsets: https://www.youtube.com/watch?v=kyLxTdsT8ws
- Thinking Recursively: https://web.stanford.edu/class/archive/cs/cs106b/cs106b.1126/lectures/07/Slides07.pdf
- Problem Understanding: https://www.youtube.com/watch?v=e2cF8a5aAhE
- Clique Decision Problem: https://www.youtube.com/watch?v=qZs767KQcvE
- Independent Set in a graph is Clique in a complement graph. https://www.youtube.com/watch?v=ST1ozPWvgjs (Only show what independent set is).
- Vertex Cover (Min number of vertex which include all edges in the graph): https://www.youtube.com/watch?v=m_dOtat56vY (Only show what Vertex cover is).
- Vertex Cover =p Independent Set:
- Vertex Cover <=p Set Cover:
- Sat & 3-Sat:
- 3-Sat <=p Independent Set:
- Hamiltonian Cycles: https://www.youtube.com/watch?v=dQr4wZCiJJ4