The minimum profile problem of a sparse matrix is theoretically treated, and by using the results a new profile reducer is proposed. Numerical experiments clarify that the new reducer is effective for the node re-ordering of graphs with rather complex configuration. Further considerations on the proposed method and numerical error of the skyline method are also given.
|Number of pages||7|
|Publication status||Published - Feb 1 1985|
ASJC Scopus subject areas
- Computer Science Applications
- Computational Theory and Mathematics