If you see en.m.wikipedia.org/wiki/Discrete_tomography the problem is right that. Now the question is: exists an algorithm that say me the maximum number of admissible point (according to the rule) that runs in linear or near-linear time? I see erdos-gallai but works only with one sequence of integers. In this case I have two sequence (row and col) and they are bipartite.