Here's my idea:
we eliminate all adjacent values on sides by minimum value. Finally there will be only values on the diagonals. We "grow" the common sides with the minimum from the two values and then cut the other two sides. After a few operations like this we have one vertex. If it's != 0 there is no solution.