@Article{cmc.2020.07467,
AUTHOR = {Qiang Wei, Guangmin Hu, Chao Shen, Yunfei Yin},
TITLE = {A Fast Method for Shortest-Path Cover Identification in Large  Complex Networks},
JOURNAL = {Computers, Materials \& Continua},
VOLUME = {63},
YEAR = {2020},
NUMBER = {2},
PAGES = {705--724},
URL = {http://www.techscience.com/cmc/v63n2/38539},
ISSN = {1546-2226},
ABSTRACT = {Fast identifying the amount of information that can be gained by measuring a 
network via shortest-paths is one of the fundamental problem for networks exploration and 
monitoring. However, the existing methods are time-consuming for even moderate-scale 
networks. In this paper, we present a method for fast shortest-path cover identification in 
both exact and approximate scenarios based on the relationship between the identification 
and the shortest distance queries. The effectiveness of the proposed method is validated 
through synthetic and real-world networks. The experimental results show that our method 
is 10<sup>5</sup>
times faster than the existing methods and can solve the shortest-path cover 
identification in a few seconds for large-scale networks with millions of nodes and edges.},
DOI = {10.32604/cmc.2020.07467}
}