well am not really sure about this stuff, but i guess if theres a 1 in each row and each coloum initially, then it is rearrangeable. i am not able to think of a rigorous proof as of now.
-Vijay
On 3/18/06, kool_guy <[EMAIL PROTECTED]> wrote:
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
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
- [algogeeks] determine whether a matrix is rearrang... kool_guy
- [algogeeks] Re: determine whether a matrix is... Vijay Venkat Raghavan N
- [algogeeks] Re: determine whether a matri... notjustamathgeek
- [algogeeks] Re: determine whether a matrix is... aj
- [algogeeks] Re: determine whether a matrix is... aakriti bhuwalka
