A note on k-shortest paths problem
โ
Nick Gravin; Ning Chen
๐
Article
๐
2010
๐
John Wiley and Sons
๐
English
โ 66 KB
๐ 1 views
It is well-known that in a directed graph, if deleting any edge will not affect the shortest distance between two specific vertices s and t, then there are two edge-disjoint paths from s to t and both of them are shortest paths. In this article, we generalize this to shortest k edgedisjoint s-t path