THE MATRIX SORTABILITY PROBLEM

Author (s) : D.MOGANRAJ

---

Abstract :
One approach to arranging a disorganized list of items into an organized list is to successively identify two blocks of contiguous items, and swap the two blocks. In a fundamental paper , showed that a special version of block swapping, in recent times called context directed swapping is the most efficient among block swapping strategies to achieve an organized list of items. The context directed swappings sorting strategy is also the most robust among block swap based sorting methods.It has been discovered that the context directed block swap operation on a list of objects generalizes to an operation on simple graphs. In turn it has been discovered that this operation on simple graphs corresponds with an operation on the adjacency matrix of a simple graph. The adjacency matrix is a symmetric square matrix with entries 0 and 1, and all diagonal entries 0. The corresponding operation is denoted Mcds, abbreviating matrix context directed swap. The operation on the adjacency matrix naturally employs the arithmetic.

Keywords : Matrix, Sorting methods

Conference Date : 17/09/2021

Pages : 101

Paper ID : IESMDT99