Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition

symposium on discrete algorithms, 2020.

Cited by: 0|Bibtex|Views6
Other Links: arxiv.org|academic.microsoft.com

Abstract:

In the decremental single-source shortest paths (SSSP) problem, the input is an undirected graph $G=(V,E)$ with $n$ vertices and $m$ edges undergoing edge deletions, together with a fixed source vertex $s\in V$. The goal is to maintain a data structure that supports shortest-path queries: given a vertex $v\in V$, quickly return an (appr...More

Code:

Data:

Your rating :
0

 

Tags
Comments