Bao Xing

Tree+DAG: An Efficient Index for Resistance Distance Computation on Core-Periphery Graphs

Resistance distance computation is a fundamental problem in graph data management. To avoid the high latency of online evaluation, recent work builds offline indexes. Existing approaches, however, fall into two families with complementary weaknesses: loop-erased random-walk methods (e.g., LEIndex) are efficient on fa...