基于路径的有向图顶点的重要度计算方法  

Path-based Vertex Ranking Method in Directed Graph

作　　者：李明[1] 赵洁[1] 郑平[1] 王婷[2] 

机构地区：[1]兰州城市学院数学学院,甘肃兰州730070 [2]华中科技大学管理学院,湖北武汉430074

出　　处：《甘肃高师学报》2015年第2期10-11,共2页Journal of Gansu Normal Colleges

摘　　要：有向图中顶点的重要度分析及其计算方法被广泛应用于控制论、信息技术等领域.提出一种基于路径的有向图顶点的重要度计算方法,使用定量分析的方法计算每个顶点在整个有向图中的重要程度,并采用一种基于迭代计算方法,提高计算速度.In particular, the vertex ranking method in directed graph is widely used in many fields, such as cybernetic theory,information science and computer science and technology. Path-based vertex ranking method in directed graph is proposed to accurately calculate a ranking score for each vertex. To speed up the calculation, a new iterative method for ranking is also presented.

关 键 词：有向图 重要度 矩阵计算 

分 类 号：O157.5[理学—数学]