Distance sensitivity oracles with subcubic preprocessing time and fast query time

We present the first distance sensitivity oracle (DSO) with subcubic preprocessing time and poly-logarithmic query time for directed graphs with integer weights in the range [−M,M].