Graph algorithms and sparsification techniques have emerged as pivotal tools in the analysis and optimisation of complex networked systems. These approaches focus on reducing the number of edges in a ...

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

High sparse Knowledge Graph is a key challenge to solve the Knowledge Graph Completion task. Due to the sparsity of the KGs, there are not enough first-order neighbors to learn the features of ...