Finding the most vital node by node contraction in communication networks

被引:0
|
作者
Wu, J [1 ]
Tan, YJ [1 ]
机构
[1] Natl Univ Def Technol, Sch Informat Syst & Management, Changsha, Hunan, Peoples R China
关键词
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In an undirected graph G = (V, E), let G*nu i denote the graph obtained from contracting nu i, viz.nu i and nodes jointed with vi are replaced by a new node. In this paper, the networks agglomeration is defined firstly. A method of evaluating nodes importance by node contraction in communication networks is proposed based on networks agglomeration. The most vital node is the one whose contraction results in the largest increase of the networks agglomeration. Both degree and position of node are considered with this method. The node contribution is evaluated directly and the result is consistent with our intuitive judgments. Final examples verify its efficiency.
引用
收藏
页码:1283 / 1286
页数:4
相关论文
共 50 条
  • [1] Finding most vital node by node importance contribution matrix in communication networks
    Zhao, Yihuan
    Wang, Zulin
    Zheng, Jing
    Guo, Xujing
    Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics, 2009, 35 (09): : 1076 - 1079
  • [2] Finding the most vital node of a shortest path
    Nardelli, E
    Proietti, G
    Widmayer, P
    THEORETICAL COMPUTER SCIENCE, 2003, 296 (01) : 167 - 177
  • [3] Finding the most vital node of a shortest path
    Nardelli, E
    Proietti, G
    Widmayer, P
    COMPUTING AND COMBINATORICS, 2001, 2108 : 278 - 287
  • [4] Finding vital node by node importance evaluation matrix in complex networks
    Zhou Xuan
    Zhang Feng-Ming
    Li Ke-Wu
    Hui Xiao-Bin
    Wu Hu-Sheng
    ACTA PHYSICA SINICA, 2012, 61 (05)
  • [5] Finding the most vital node with respect to the number of spanning trees
    Chen, Y
    Hu, AQ
    Yip, KW
    Hu, J
    Zhong, ZG
    PROCEEDINGS OF 2003 INTERNATIONAL CONFERENCE ON NEURAL NETWORKS & SIGNAL PROCESSING, PROCEEDINGS, VOLS 1 AND 2, 2003, : 1670 - 1673
  • [6] Evaluating the Vital Communication Node Based on Node Estranging
    Meng, Xian-Gang
    Liu, Jian-Qiang
    Hou, Li-Ya
    INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND COMMUNICATION ENGINEERING (CSCE 2015), 2015, : 395 - 400
  • [7] Finding the detour-critical node of the shortest path in communication networks
    Yan, Huahai
    Fan, Yiwei
    Gu, Tao
    DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES A-MATHEMATICAL ANALYSIS, 2006, 13 : 589 - 593
  • [8] The most vital node of the shortest path under uncertainty
    Yan, Huahai
    2006 International Conference on Computational Intelligence and Security, Pts 1 and 2, Proceedings, 2006, : 912 - 915
  • [9] FINDING N MOST VITAL LINKS IN FLOW NETWORKS
    RATLIFF, HD
    SICILIA, GT
    LUBORE, SH
    MANAGEMENT SCIENCE SERIES A-THEORY, 1975, 21 (05): : 531 - 539
  • [10] Finding the Anti-block Vital Node of a Shortest Path
    Nie, Zhe
    Li, Yueping
    2009 INTERNATIONAL CONFERENCE ON NEW TRENDS IN INFORMATION AND SERVICE SCIENCE (NISS 2009), VOLS 1 AND 2, 2009, : 680 - 684