Sensitive Distance and Reachability Oracles for Large Batch Updates

Jan van den Brand
Jan van den Brand

2019 IEEE 60TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2019), pp. 424.0-435, 2019.

Cited by: 5|Bibtex|Views7|DOI:https://doi.org/10.1109/FOCS.2019.00034
EI
Other Links: academic.microsoft.com|dblp.uni-trier.de|arxiv.org

Abstract:

In the sensitive distance oracle problem, there are three phases. We first preprocess a given directed graph G with n nodes and integer weights from [-W, W]. Second, given a single batch of f edge insertions and deletions, we update the data structure. Third, given a query pair of nodes (u, v), return the distance from u to v. In the easi...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments