Most vital vertices for the shortest s–t path problem: complexity and Branch-and-Cut algorithm
Sign Up to like & getrecommendations! Published in 2020 at "Optimization Letters"
DOI: 10.1007/s11590-019-01527-5
Abstract: In this paper we study the most vital vertices for the shortest s–t path problem. This problem consists, given a digraph $$D=(V\cup \{s,t\},A)$$D=(V∪{s,t},A) and a threshold $$d\in \mathbb {N}$$d∈N, in finding the minimum number of… read more here.
Keywords: vital vertices; vertices shortest; path problem; shortest path ... See more keywords