Finding the most vital node by node contraction in communication networks
暂无分享,去创建一个
Wu Jun | Tan Yue-jin | Wu Jun | Tan Yue-jin
[1] Enrico Nardelli,et al. Finding the most vital node of a shortest path , 2003, Theor. Comput. Sci..
[2] A. K. Mittal,et al. The k most vital arcs in the shortest path problem , 1990 .
[3] L. Page,et al. Reliability polynomials and link importance in networks , 1994 .
[4] Enrico Nardelli,et al. Finding the Detour-Critical Edge of a Shortest Path Between Two Nodes , 1998, Inf. Process. Lett..
[5] R. Vohra,et al. Finding the most vital arcs in a network , 1989 .
[6] Albert-László Barabási,et al. Error and attack tolerance of complex networks , 2000, Nature.
[7] Lih-Hsing Hsu,et al. Finding the Most Vital Edge with Respect to Minimum Spanning Tree in Weighted Graphs , 1991, Inf. Process. Lett..
[8] H. W. Corley,et al. Most vital links and nodes in weighted networks , 1982, Oper. Res. Lett..