Please, Please, Please we need more videos like this for the whole algorithm course. it is very helpful and your approach is easy and clear to follow. Thanks
I'm not sure I agree here that Maximal Clique problem does not have optimal substructure. Here you're looking only at one partition {1,2,3,4, 5,6,7}, {8,9}. The definition of optimal substructure is "optimal solutions to a problem incorporate optimal solutions to related subproblems, which we may solve independently." This doesn't mean any partition of subproblems but some particular set of subproblems. If we partition to {1,2,3,4}, {5,6,7,8,9}. We get the optimal solution as maximum of two subproblems.
Please, Please, Please we need more videos like this for the whole algorithm course. it is very helpful and your approach is easy and clear to follow. Thanks
This series is really helpful, thanks for the work!
Yo man, thanks for all your videos.
I'm not sure I agree here that Maximal Clique problem does not have optimal substructure. Here you're looking only at one partition {1,2,3,4, 5,6,7}, {8,9}. The definition of optimal substructure is "optimal solutions to a problem incorporate optimal solutions to related subproblems, which we may solve independently." This doesn't mean any partition of subproblems but some particular set of subproblems. If we partition to {1,2,3,4}, {5,6,7,8,9}. We get the optimal solution as maximum of two subproblems.
hi Karim,
Thanks for your DP videos. Which standard book ,do you recommend for studying?