A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Given a graph with labels defined on edges and a source-sink pair (s, t), the Label s-t Cut problem asks for a minimum number of labels such that the removal of edges with these labels disconnects s and t. Similarly, the Global Label Cut problem asks for a minimum number of labels to disconnect G itself. For these two problems, we identify two useful parameters, i.e., l max , the maximum length of any s-t path (only applies to Label s-t Cut), and f max , the maximum number of appearances of anydoi:10.1016/j.tcs.2016.08.006 fatcat:2lvdwbzounhpplvtcfkt4zcf5e