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 ...

Graph has been widely used in various applications, while how to optimize the graph is still an open question. In this paper, we propose a framework to optimize the graph structure via structure ...

DCGCN decomposes the 3D point cloud data of a molecule into three components: atomic sequence, atomic connectivity, and a distance map. From its connectivity and distance information, DCGCN captures ...