K-Path centrality is based on the flow of information in a graph along simple paths of length at most K. This work addresses the computational cost of estimating K-path centrality in large-scale ...

Moreover, attribute to the massive data, the SSGCN with complex computation is generally too time- and resource-consuming to be applicable in real-time needs. To conquer these issues, we propose an ...