Finding the Shortest Path with Vertex Constraint over Large Graphs

Abstract

Graph is an important complex network model to describe the relationship among various entities in real applications, including knowledge graph, social network, and traffic network. Shortest path query is an important problem over graphs and has been well studied. This paper studies a special case of the shortest path problem to find the shortest path passing through a set of vertices specified by user, which is NP-hard. Most existing methods calculate all permutations for given vertices and then find the shortest one from these permutations. However, the computational cost is extremely expensive when the size of graph or given set of vertices is large. In this paper, we first propose a novel exact heuristic algorithm in best-first search way and then give two optimizing techniques to improve efficiency. Moreover, we propose an approximate heuristic algorithm in polynomial time for this problem over large graphs. We prove the ratio bound is 3 for our approximate algorithm. We confirm the efficiency of our algorithms by extensive experiments on real-life datasets. The experimental results validate that our algorithms always outperform the existing methods even though the size of graph or given set of vertices is large.

Exploiting knowledge graphs in industrial products and services: A survey of key aspects, challenges, and future perspectives

“…According to the review in Sec 3.1, most efforts are paid to the optimization of the accuracy and efficiency of knowledge reasoning [96][97][98], but user interaction is not emphasized. In fact, design and optimization for user interactions are mostly considered to be a business and management activity, which is seldom concerned in researches of computer science disciplines.…”

COV19-Dijkstra: A COVID-19 Propagation Model Based on Dijkstra’s Algorithm

“…In this study, we use Dijkstra's algorithm which is an algorithm that consists of computing the shortest paths in order to prevent and combat COVID-19 transmission for a large-scale graph. Indeed, researchers have been confronted with finding the shortest paths with the upper constraint on large graphs (Yang et al, 2019) and using a shortest path based method for gene analysis and prediction (Zhu et al, 2016). We propose both a new way to simulate COVID-19 propagation on large graphs and a COVID-19 propagation model based on the Dijkstra algorithm for analysis and prediction.…”

Algorithm for the Accelerated Calculation of Conceptual Distances in Large Knowledge Graphs

“…Chakaravarthy et al (2016) [11] introduced a scalable parallel algorithm that significantly reduces internode communication traffic and achieves high processing rates on large graphs. Yang et al (2019) [12] focused on routing optimization algorithms based on node-compression in big data environments, addressing the common problem of finding the shortest path in a limited time and the number of connected nodes. Liu et al (2019) [13] presented a navigation algorithm based on a navigator data structure that effectively navigates the shortest path with high probability in massive complex networks.…”