Many graph processing systems and graph libraries have been developed to process and analyze graph data efficiently. Among the built-in graph algorithms, priority-based graph algorithms, such as Dijkstra's algorithm and greedy algorithms for combination optimization problems, e.g., influence maximization problem, rep...
Si-Yi Teng, Jeffrey Xu Yu· Proceedings of the ACM on Ma...· 0 citations
ThunderGNN is a hardware-aware acceleration system designed to reconcile graph irregularity with Tensor Core rigidity and significantly outperforms state-of-the-art systems, achieving geometric mean speedups of 1.89× over DGL and 2.59× over PyG.
Yuang Chen, Si-Yi Teng, Wen-Qi Zeng et al.· Proceedings of the VLDB Endo...· 0 citations
This work studies a new query-efficient cycle basis (QCB) problem and devise efficient algorithms to find QCB with enhanced efficiency to enumerate cycles, and demonstrates the efficiency and scalability of the cycle enumeration algorithm based on QCB.