activity
20092026
most citedFully dynamic all-pairs shortest paths with worst-case update-time revisited

25 citations · 56 across the 23 of their papers we have counts for

collaborators
Showing 2013Show all

2 papers · 1 filter

cs.DS2013★ 9 cited

Dynamic Decremental Approximate Distance Oracles with stretch

Ittai Abraham, Shiri Chechik

We provide a decremental approximate Distance Oracle that obtains stretch of multiplicative and 2 additive and has total cost (where notation sup…

cs.DS2013★ 8 cited

Approximate Distance Oracle with Constant Query Time

Shiri Chechik

An approximate distance oracle is a succinct data structure that provides fast answers to distance queries between any two nodes. In this paper we consider approximate distance ora…