A Top-Down Scheme for Coverage Centrality Queries on Road Networks

Abstract

AbstractCoverage Centrality is an important metric to evaluate the node importance in road networks. However, the current solutions have to compute the coverage centrality of all the nodes together, which is resource-wasting especially when only some nodes’ centrality is required. In addition, they have poor adaption to the dynamic scenario because of the computation inefficiency. In this paper, we focus on the coverage centrality query problem and propose an efficient algorithm to compute the centrality of a single node efficiently in both static and dynamic scenarios, with the help of the intra-region pruning, inter-region pruning, and top-down search. Experiments validate the efficiency and effectiveness of our algorithm compared with the state-of-the-art method.KeywordsCoverage CentralityRoad networkShortest path