期刊文献+

一个寻找外围节点的算法

An Algorithm For Finding Peripheral Nodes
原文传递
导出
摘要 指出了著名的用于降低稀疏矩阵带宽的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
  • 相关文献

参考文献4

  • 1Gibbs N, Poole W, Stockmeyer P. An algorithm for reducing the bandwidth and profile of a sparse matrix[J]. SIAM J Num Anal,1976,13(2):236-250. 被引量:1
  • 2Lewis J G. Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King algorithms[J]. ACM Trans on Math Soft, 1982,8: 180-189. 被引量:1
  • 3William W Hager. Minimizing the profile of a symmetric matrix[J]. SIAM Journal on Scientific Computing, 23(5) : 1799-1816. 被引量:1
  • 4Andrew Lim, Bian Rodrigues, Fei Xiao. A Centroid-based Approach lo Solve the Bandwidth Minimization Problem[M]. Proeeedings of the 37^th Hawaii International Conferenee on System Sciences, 2004. 被引量:1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部