Shortest paths avoiding forbidden subpaths
Shortest paths avoiding forbidden subpaths
Abstract We study a variant of the shortest path problem in graphs: given a weighted graph G and vertices s and t , and given a set X of forbidden paths in G , find a shortest s ‐ t path P such that no path in X is a …