Find in Library

A pseudo-peripheral node was found by the Gibbs-Poole-Stockmeyer algorithm as the staring node for reducing bandwidth of a sparse matrix. This influences algorithm's performance because it is shown in this paper that eccentric distance of a pseudo-peripheral node may much less than diameter of the graph. The best selection of the staring node is a peripheral node whose eccentric distance is equal to diameter of the graph. A peripheral node finding algorithm was proposed in this paper. This algorithm can be applied to improvement of sparse matrix bandwidth reducing algorithms' performance. Correctness and efficiency of it were proved. Some computing experiments were done.