Hanlin Ren

activity

20202026

most citedConstructing a Distance Sensitivity Oracle in

O (n^{2.5794} M)

Time

5 citations · 7 across the 6 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

cs.DS2021

Maintaining Exact Distances under Multiple Edge Failures

Ran Duan, Hanlin Ren

We present the first compact distance oracle that tolerates multiple failures and maintains exact distances. Given an undirected weighted graph $G = (V, E)$ and an arbitrarily larg…

cs.DS2021★ 5 cited

Constructing a Distance Sensitivity Oracle in $O (n^{2.5794} M)$ Time

Yong Gu, Hanlin Ren

We continue the study of distance sensitivity oracles (DSOs). Given a directed graph $G$ with $n$ vertices and edge weights in ${1, 2, \dots, M}$ , we want to build a data structu…

Maintaining Exact Distances under Multiple Edge Failures

Constructing a Distance Sensitivity Oracle in O(n2.5794M) Time

Constructing a Distance Sensitivity Oracle in $O (n^{2.5794} M)$ Time