| 一个寻找外围节点的算法 |
| |
| 引用本文： | 谷峰. 一个寻找外围节点的算法[J]. 数学的实践与认识, 2008, 38(23) |
| |
| 作者姓名： | 谷峰 |
| |
| 作者单位： | 浙江经济职业技术学院,浙江,310012 |
| |
| 摘 要： | 指出了著名的用于降低稀疏矩阵带宽的Gibbs-Poole-Stockmeyer方法中所找到的伪外围节点的偏心距可能远小于图的直径.由此提出了一个寻找外围节点的算法,证明了其正确性和有效性.
|
| 关 键 词： | 稀疏矩阵 带宽 外围节点 |
An Algorithm For Finding Peripheral Nodes |
| |
| GU Feng. An Algorithm For Finding Peripheral Nodes[J]. Mathematics in Practice and Theory, 2008, 38(23) |
| |
| Authors: | GU Feng |
| |
| Affiliation: | Zhejiang Technology Institute of Economy;Hangzhou Zhejiang 310018;China |
| |
| Abstract: | 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. |
| |
| Keywords: | sparse matrix bandwidth peripheral node |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
