Rong-Hua Li

activity

20182026

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2026

An $m + n^{3/2}$ algorithm for counting spanning trees by $ℓ_{1}$ -regularized resistance

Rong-Hua Li, Yichun Yang

We study the basic problem of approximating the number of spanning trees of a graph. For a graph with $n$ vertices, $m$ edges, We propose an algorithm that approximates the number…

cs.DS2025

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…

An m+n3/2 algorithm for counting spanning trees by ℓ1​-regularized resistance

BD-Index: Scalable Biharmonic Distance Queries on Large Graphs via Divide-and-Conquer Indexing

An $m + n^{3/2}$ algorithm for counting spanning trees by $ℓ_{1}$ -regularized resistance