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

2. 10 Points] A transversal in a n x n matrix is a set of n entries no two of which belong to the input the same column. Design an efficient algorithm that matrix M апхп same row or on all of whose entries are 0 or 1 will determine whether M has a transversal consisting only of 1’s Describe your algorithm in English and analyze its running time. For example, given the matrices 0 1 0 В – 0 1 0 1 A and 1 0 1 1 1 1 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 *