摘要
指出了著名的用于降低稀疏矩阵带宽的Gibbs-Poole-Stockmeyer方法中所找到的伪外围节点的偏心距可能远小于图的直径.由此提出了一个寻找外围节点的算法,证明了其正确性和有效性.
The weakness of the famous Gibbs-Poole-Stockmeyer algorithm for reducing the bandwidth and profile of a sparse matrix was pointed out. The eccentricity of the pseud peripheral nodes it found may be much less than diameter of the graph. An algorithm for finding peripheral nodes which are useful for reducing the bandwidth of a sparse matrix was put up and its correctness and efficiency were proved.
出处
《数学的实践与认识》
CSCD
北大核心
2008年第23期171-174,共4页
Mathematics in Practice and Theory
关键词
稀疏矩阵
带宽
外围节点
sparse matrix
bandwidth
peripheral node