New re‐ordering algorithm for skyline method
Abstract
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.
Citation
Taniguchi, T. and Soga, A. (1985), "New re‐ordering algorithm for skyline method", Engineering Computations, Vol. 2 No. 2, pp. 107-113. https://doi.org/10.1108/eb023608
Publisher
:MCB UP Ltd
Copyright © 1985, MCB UP Limited