Kaito Harada

collaborators

2 papers

cs.DS2026

A Simple Algorithm for the Directed Multiple Source Replacement Paths Problem

Kaito Harada, Taisuke Izumi

In the replacement paths (RP) problem, we are given a graph $G = (V, E)$ with $n = ∣ V ∣$ and $m = ∣ E ∣$ , together with two vertices $s, t \in V$ , and are asked to compute the shortes…

cs.DS2024

A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles

Kaito Harada, Naoki Kitamura, Taisuke Izumi +1

An \emph{ $α$ -approximate vertex fault-tolerant distance sensitivity oracle} (\emph{ $α$ -VSDO}) for a weighted input graph $G = (V, E, w)$ and a source vertex $s \in V$ is the data str…