An Approximation Algorithm for Shortest Path Based on the Hierarchical Networks

Social networks have become a "household name" for internet users. Identifying shortest paths between nodes in such networks is intrinsically important in reaching out to users on such networks. In this paper we propose an efficient algorithm that can scale up to large social networks. The algorithm iteratively constructs higher levels of hierarchical networks by condensing the central nodes and their neighbors into super nodes until a smaller network is realized. Shortest paths are approximated by corresponding super nodes of the newly constructed hierarchical network. Experimental results show an appreciable improvement over existing algorithms.