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...
No takes yet. Share an insight, caveat, or question.
F DraganFeodor (2005) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: