3 citations · 5 across the 13 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DS2024★ 1 cited
Independent Set Reconfiguration Under Bounded-Hop Token
Hiroki Hatano, Naoki Kitamura, Taisuke Izumi +2
The independent set reconfiguration problem (ISReconf) is the problem of determining, for given independent sets I_s and I_t of a graph G, whether I_s can be transformed into I_t b…
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 and a source vertex is the data str…