D. Torrieri, “Algorithms for finding an optimal set of short disjoint paths in a communication network,” Com-munications, IEEE Transactions, Vol. 40, No. 11, pp. 1698–1702, 1992.

has been cited by the following article:

• TITLE: Research on LFS Algorithm in Software Network

  AUTHORS: Wei Wang, Hai Zhao, Hui Li, Jun Zhang, Peng Li, Zheng Liu, Naiming Guo, Jian Zhu, Bo Li, Shuang Yu, Hong Liu, Kunzhan Yang

  KEYWORDS: LFS, Software Network, the Shortest Path, Betweenness Centrality

  JOURNAL NAME: Journal of Software Engineering and Applications, Vol.3 No.2, March 2, 2010

  ABSTRACT: Betweenness centrality helps researcher to master the changes of the system from the overall perspective in software network. The existing betweenness centrality algorithm has high time complexity but low accuracy. Therefore, Layer First Searching (LFS) algorithm is proposed that is low in time complexity and high in accuracy. LFS algorithm searches the nodes with the shortest to the designated node, then travels all paths and calculates the nodes on the paths, at last get the times of each node being traveled which is betweenness centrality. The time complexity of LFS algorithm is O(V2).