I am looking for an (efficient) algorithm that computes the largest complete table in a table with missing cells. So for example: In
| a | b | c | d |
|---|---|---|---|
| e | f | h |
is the maximum complete table
| a | b |
|---|---|
| e | f |
Optional: It would be great if one could adjust the measure. So for example instead of counting cells, the number of rows and/or columns would be important.