【24h】

Edge Betweenness Centrality on Trees

机译:树的边缘中间性

获取原文

摘要

Computing the edge betweenness centrality is an important step in a great deal of the analysis tasks of community structures in complex networks. It mostly serves as a measure for the traffic or flow of a particular edge in connecting various parts or communities together. Various algorithms that compute the edge betweenness centrality in general graphs exist but they are expensive. In this paper, we design an algorithm that takes advantage of the structure of tree graphs to compute the edge betweenness centrality more efficiently in such graphs and perform experiments on random graphs.
机译:计算边缘中间性中心性是复杂网络中大量社区结构分析任务中的重要步骤。在将各个部分或社区连接在一起时,它主要用作特定边缘的流量或流量的度量。存在各种计算一般图中的边缘中间性中心度的算法,但是它们很昂贵。在本文中,我们设计了一种算法,该算法利用树图的结构来更有效地计算此类图的边缘中间性中心度,并在随机图上进行实验。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号