title: Find cut set in a graph
body: <blockquote>
    <p><strong>Possible Duplicate:</strong><br>
    <a href="https://stackoverflow.com/questions/5768329/algorithm-for-g-v-e-how-to-determine-if-the-set-of-edgese-belong-to-e-is">Algorithm: for G = (V,E), how to determine if the set of edges(e belong to E) is a valid cut set of a graph</a>  </p>
  </blockquote>
  
  
  
  <p>A subset S, of edges of a graph G = (V,E), how can one check whether it is a <strong>valid cut-set</strong> of the graph or not? 
  Note: A cut is a partition of the vertices of a graph into two disjoint subsets. So, cut-set of the cut is the set of edges whose end points are in different subsets of the partition. I am interested to find an algorithm for this problem</p>