2. 10 Points A transversal in a n x n matrix is a set of n entries no two of which belong to the same row or the same column.

2. 10 Points A transversal in a n x n matrix is a set of n entries no two of which belong to the same row or the same column. Design an efficient algorithm that on input a nxn matrix M all of whose entries are 0 or 1 will determine whether M has a transversal consisting only of l’s. Describe your algorithm in English and analyze its running time. For example, given the matrices 1 0 A = and B= 1 1 1 1 1 0 1 1 A has a transversal of 1’s but B doesn’t



Source link

Leave a Reply

Your email address will not be published. Required fields are marked *