A note on finding shortest path trees
Aaron Kershenbaum · Networks · 1981
Abstract Two shortest path algorithms are compared and it is shown that, while one outperforms the other in practice, the former's running time is exponential in the worst case while the latter's is polynomial. A procedure which constructs such worst case examples is given.