Title :
A note on sorting sparse matrices
Author_Institution :
University of Wisconsin, Madison, WI
Abstract :
The problem of sorting all the rows of a sparse matrix according to increasing or decreasing column indices is considered. An algorithm for doing the sort in order τ operations (where τ is the number of nonzeroes in the matrix) is given.
Keywords :
Algorithms; Circuit theory; Data structures; Graph theory; Psychology; Sorting; Sparse matrices;
Journal_Title :
Proceedings of the IEEE
DOI :
10.1109/PROC.1979.11456
