Given an undirected graph, with or without edge costs, and three vertices r,s,t, determine the complexity of finding a minimum-cost edge set whose deletion increases each of…
Statement
Given an undirected graph, with or without edge costs, and three vertices r,s,t, determine the complexity of finding a minimum-cost edge set whose deletion increases each of the distances d(r,s), d(r,t), and d(s,t) by at least 1.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.