2 citations · 2 across the 10 of their papers we have counts for
5 papers · 1 filter
BD-Index: Scalable Biharmonic Distance Queries on Large Graphs via Divide-and-Conquer Indexing
Yueyang Pan, Meihao Liao, Rong-Hua Li
Biharmonic distance (\bd) is a powerful graph distance metric with many applications, including identifying critical links in road networks and mitigating over-squashing problem in…
Scalable and Provable Kemeny Constant Computation on Static and Dynamic Graphs: A 2-Forest Sampling Approach
Cheng Li, Meihao Liao, Rong-Hua Li +1
Kemeny constant, defined as the expected hitting time of random walks from a source node to a randomly chosen target node, is a fundamental metric in graph data management with man…
Improved Algorithms for Effective Resistance Computation on Graphs
Yichun Yang, Rong-Hua Li, Meihao Liao +1
Effective Resistance (ER) is a fundamental tool in various graph learning tasks. In this paper, we address the problem of efficiently approximating ER on a graph $\mathcal{G}=(\mat…
Scalable Algorithms for Laplacian Pseudo-inverse Computation
Meihao Liao, Rong-Hua Li, Qiangqiang Dai +2
The pseudo-inverse of a graph Laplacian matrix, denoted as , finds extensive application in various graph analysis tasks. Notable examples include the calculation of ele…
Scaling Up Maximal k-plex Enumeration
Qiangqiang Dai, Rong-Hua Li, Hongchao Qin +2
Finding all maximal -plexes on networks is a fundamental research problem in graph analysis due to many important applications, such as community detection, biological graph ana…