Qiang Wei1, 2, *, Guangmin Hu1, Chao Shen3, Yunfei Yin4, 5
CMC-Computers, Materials & Continua, Vol.63, No.2, pp. 705-724, 2020, DOI:10.32604/cmc.2020.07467
- 01 May 2020
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 105
times faster than the existing methods and More >
Login
Register
