Work

Compact and Fast Sensitivity Oracles for Single-Source Distances

Year: 2016

Type: preprint

Abstract: Let $s$ denote a distinguished source vertex of a non-negatively real weighted and undirected graph $G$ with $n$ vertices and $m$ edges. In this paper we present two efficient \emph{single-source approximate-distance sensitivity oracles}, namely \emph{compact} data structures which are able to \emph{quickly} report an approximate (by a multiplicative stretch factor) distance from $s$ to any node of $G$ following the failure of any edge in $G$. More precisely, we first present a sensitivity oracle of size $O(n)$ which is able to report 2-approximate distances from the source in $O(1)$ time. Then, we further develop our construction by building, for any $0

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1608.04769

Authors: Bilò, Davide, Gualà, Luciano, Leucci, Stefano, Proietti, Guido

Institutions: University of Sassari, University of Rome Tor Vergata, Sapienza University of Rome, University of L'Aquila

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2952837110

Cites: 12

Cited by: 4

Related to: 20