Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time

Jan van den Brand
Jan van den Brand

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

Cited by: 5|Bibtex|Views7|
EI
Keywords:
data-structuresdynamic algorithmsdiameterradiuseccentricitiesMore(3+)

Abstract:

Consider the following distance query for an n-node graph G undergoing edge insertions and deletions: given two sets of nodes I and J, return the distances between every pair of nodes in I x J. This query is rather general and captures several versions of the dynamic shortest paths problem. In this paper, we develop an efficient (1 + epsi...More

Code:

Data:

Your rating :
0

 

Tags
Comments