Research on the Algorithm for Degree of Network Relation Coupling in Complez Networks

摘要：

The complex network can describe the topology of complex system, and the topology of complex network can affect the coupling among the activities of network node. Based on the topology of complex network, the concepts of Degree of Network Relation Coupling (DNRC) are defined by using the paths of network. In order to resolve the paths of complex network, the linear planning model is constructed firstly in this paper. At the same time, the Dijkstra algorithm for resolving the shortest path of the network which has positive weight is discussed. Then, we present a method which can transfer non-weight complex network to positive weight network. We also discuss how to resolve the entire shortest path between any two nodes. Based on the sort order of all paths between any two nodes in complex network, we also discuss how to resolve the second shortest path or more length paths in complex network. At last, some conclusions are presented in this paper.

作者: Shouwei LI Yongtai CHEN

作者单位: Department of Information Management, Jiangsu University, Zhenjiang, Jiangsu Province 212013 P. R. C Department of Information Management,Jiangsu University, Zhenjiang, Jiangsu Province 212013 P. R. Ch

会议类型: 国际会议

会议名称: 2009 IEEE International Conference on Grey System and Intelligent Services(2009 IEEE灰色系统与服务科学国际会议)

会议地点: 南京

会议语种:英文

页码: 1618-1623

在线出版日期: 2009-10-20（万方平台首次上网日期，不代表论文的发表时间）