Next Article in Journal
New Numerical Treatment for a Family of Two-Dimensional Fractional Fredholm Integro-Differential Equations
Previous Article in Journal
Adaptive Scatter Search to Solve the Minimum Connected Dominating Set Problem for Efficient Management of Wireless Networks
Open AccessArticle

Approximation Algorithm for Shortest Path in Large Social Networks

Big Data Research Center, University of Electronic Science and Technology of China, Chengdu 610051, China
*
Author to whom correspondence should be addressed.
Algorithms 2020, 13(2), 36; https://doi.org/10.3390/a13020036
Received: 31 December 2019 / Revised: 28 January 2020 / Accepted: 31 January 2020 / Published: 6 February 2020
Proposed algorithms for calculating the shortest paths such as Dijikstra and Flowd-Warshall’s algorithms are limited to small networks due to computational complexity and cost. We propose an efficient and a more accurate approximation algorithm that is applicable to large scale networks. Our algorithm iteratively constructs levels of hierarchical networks by a node condensing procedure to construct hierarchical graphs until threshold. The shortest paths between nodes in the original network are approximated by considering their corresponding shortest paths in the highest hierarchy. Experiments on real life data show that our algorithm records high efficiency and accuracy compared with other algorithms. View Full-Text
Keywords: parallel programing; complex networks; hierarchical networks; approximation algorithm; shortest path parallel programing; complex networks; hierarchical networks; approximation algorithm; shortest path
Show Figures

Figure 1

MDPI and ACS Style

Mensah, D.N.A.; Gao, H.; Yang, L.W. Approximation Algorithm for Shortest Path in Large Social Networks. Algorithms 2020, 13, 36.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop