3 citations · 3 across the 5 of their papers we have counts for
1 paper · 1 filter
Guantao Chen, Xing Feng, Fuliang Lu +2
An edge cut C of a graph G is {\it tight} if ∣C∩M∣=1 for every perfect matching M of G.~Barrier cuts and 2-separation cuts are called {\it ELP-cuts}, which are two i…