The problem can be reduce to find the submatrix with the max area...for that there is a algorithm in o(n*n*n*n) or o(n*n*n), try with DP.
2011/9/10 Neha Singh <neha.ndelhi.1...@gmail.com> > Given a matrix containing only 1s and 0s. Find the largest sub matrix > containing only 1s(not necessarily a square sub matrix) ???? > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Victor Manuel Grijalva Altamirano Universidad Tecnologica de La Mixteca -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
