4 papers
Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs
Yichun Yang, Longlong Lin, Rong-Hua Li +2
The computation of resistance distance is pivotal in a wide range of graph analysis applications, including graph clustering, link prediction, and graph neural networks. Despite it…
Scalable Similarity Search over Large Attributed Bipartite Graphs
Xi Ou, Longlong Lin, Zeli Wang +2
Bipartite graphs are widely used to model relationships between entities of different types, where nodes are divided into two disjoint sets. Similarity search, a fundamental operat…
Fast Biclique Counting on Bipartite Graphs: A Node Pivot-based Approach
Xiaowei Ye, Rong-Hua Li, Longlong Lin +2
Counting the number of -bicliques (complete bipartite subgraphs) in a bipartite graph is a fundamental problem which plays a crucial role in numerous bipartite graph analys…
Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach
Yichun Yang, Rong-Hua Li, Meihao Liao +2
Graph propagation (GP) computation plays a crucial role in graph data analysis, supporting various applications such as graph node similarity queries, graph node ranking, graph clu…