Estimating all pairs shortest paths in restricted graph families
F DraganFeodor · Journal of Algorithms · 2005
In this paper we show that a very simple and efficient approach can be used to solve the all pairs almost shortest path problem on the class of weakly chordal graphs and its different subclasses. M...