| 信息网络分解的可及向量法 |
| |
| 引用本文： | 孙登文,曲德林,赵奎元,苏健民.信息网络分解的可及向量法[J].清华大学学报(自然科学版),1987(4). |
| |
| 作者姓名： | 孙登文 曲德林 赵奎元 苏健民 |
| |
| 作者单位： | 化学工程系
(孙登文，曲德林，赵奎元)，化学工程系(苏健民) |
| |
| 摘 要： | 本文的内容是一种新的信息网络分解方法。作者基于节点初始序列的思想，又引入了可及向量和局部邻接矩阵的概念。通过可及向量的计算寻求切割流线集和节点计算序列。此法的特点是易于程序化，计算迅速，能处理大型网络。
|
| 关 键 词： | 节点度 可及向量 局部邻接矩阵 |
Reachable Vector Method for Network Decomposition |
| |
| Sun dengwen,Qn Delin,Zhao Kuiyuan,Su Jianmin.Reachable Vector Method for Network Decomposition[J].Journal of Tsinghua University(Science and Technology),1987(4). |
| |
| Authors: | Sun dengwen Qn Delin Zhao Kuiyuan Su Jianmin |
| |
| Institution: | Department of Chemical Engineering |
| |
| Abstract: | The paper presents a new method for information network decomposition. Based on the idea of initial vertices sequence, and introduced the concepts of reachable vector and local adjacent matrix, the torn stream set and vertices calculation sequence can be found by the computation of the reachable vector. This method have an advantage that is characterized by the easiness to be programmed, and high calculation speed, it can be used to large network system. |
| |
| Keywords: | degree of vertices reachable vector local adjacent matrix |
| 本文献已被 CNKI 等数据库收录！ |
