A Novel Shortest Path Identification Algorithm Based on Optimization Strategies

In present scenario of many application environments, analysis of large network that includes protein interactions in biological component, online social network and internet traffic analysis has become a decisive component. Accordingly, graph analysis applications play a significant role that may rely on computing distances between node pairs and the shortest path between such nodes. With those concerns, this paper presents a novel method of top-k path join strategy for group relationship analysis. The major intention of this work is to discover top-k shortest paths between a pair of node sets. Bellmam-ford algorithm is used here for finding the shortest path between the node pair. Further, the shortest path between the nodes pairs are identified based on two optimization strategies namely, push join constraint and pruning search space with some scalable determined thresholds. The cost and processing time is well optimized here using candidate path searching mechanism. The efficiency of the proposed work has been analyzed by conducting extensive performance studies.