Let A be a "n by n" matrix. A is rearrangeable if there is a way to swap rows with rows, and columns with columns, such that after the swapping, all diagonal entries of A are equal to 1.
Can someone give an algorithm that determines whether a matrix is rearrangeable? Thanks. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
