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 2020Show all

2 papers · 1 filter

cs.DS2020

Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time

Hanlin Ren

We consider the problem of building Distance Sensitivity Oracles (DSOs). Given a directed graph $G = (V, E)$ with edge weights in ${1, 2, \dots, M}$ , we need to preprocess it into…

cs.DS2020★ 1 cited

Approximate Distance Oracles Subject to Multiple Vertex Failures

Ran Duan, Yong Gu, Hanlin Ren

Given an undirected graph $G = (V, E)$ of $n$ vertices and $m$ edges with weights in $[1, W]$ , we construct vertex sensitive distance oracles (VSDO), which are data structures that pre…