Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch

11/08/2022
by   Sebastian Forster, et al.
0

We provide the first deterministic data structure that given a weighted undirected graph undergoing edge insertions, processes each update with polylogarithmic amortized update time and answers queries for the distance between any pair of vertices in the current graph with a polylogarithmic approximation in O(loglog n) time. Prior to this work, no data structure was known for partially dynamic graphs, i.e., graphs undergoing either edge insertions or deletions, with less than n^o(1) update time except for dense graphs, even when allowing randomization against oblivious adversaries or considering only single-source distances.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/28/2018

Decremental SPQR-trees for Planar Graphs

We present a decremental data structure for maintaining the SPQR-tree of...
research
01/29/2020

New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs

In the dynamic Single-Source Shortest Paths (SSSP) problem, we are given...
research
04/18/2023

A New Deterministic Algorithm for Fully Dynamic All-Pairs Shortest Paths

We study the fully dynamic All-Pairs Shortest Paths (APSP) problem in un...
research
12/20/2022

Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme

Personalized PageRank (PPR) stands as a fundamental proximity measure in...
research
01/24/2019

Dolha - an Efficient and Exact Data Structure for Streaming Graphs

A streaming graph is a graph formed by a sequence of incoming edges with...
research
04/11/2018

Fully Dynamic Effective Resistances

In this paper we consider the fully-dynamic All-Pairs Effective Resistan...
research
05/08/2022

Near-Optimal Deterministic Vertex-Failure Connectivity Oracles

We revisit the vertex-failure connectivity oracle problem. This is one o...

Please sign up or login with your details

Forgot password? Click here to reset