Minimum shared‐power edge cut
Minimum shared‐power edge cut
Abstract We introduce a problem called minimum shared‐power edge cut ( MSPEC ). The input to the problem is an undirected edge‐weighted graph with distinguished vertices s and t , and the goal is to find an s ‐ t cut by assigning “powers” at the vertices and removing an …