Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path problem

Dipan Dey, Manoj Gupta

In a graph $G$ with a source $s$, we design a distance oracle that can answer the following query: Query$(s,t,e)$ -- find the length of shortest path from a fixed source $s$ to any…