欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
采用综合考虑节点的局部特性和全局特性的方法来评价复杂网络的节点重要度，给出基于邻域的节点重要度算法及基于关键域的节点重要度算法．前一种算法有效地降低了计算的复杂度；后一种算法能更有效地刻画节点的重要度且适用于加权图．然后通过实例验证两种算法的有效性．
英文摘要：
Node importance in complex networks was evaluated by taking comprehensively the local and global property of nodes into consideration. Two algorithms were given to determine the node importance： one was based on neighborhood and the other was based on key field. The former algorithm could be used to decrease the computational complexity efficiently and the latter efficiently characterize the node importance and suit to weighted graph. Finally, the validity of these two algorithms was verified by giving an example.
同期刊论文项目
同项目期刊论文
Checking strong optimality of interval linear programming with inequality constraints and nonnegativ
期刊信息
位置：