Posting a message to the forum will remove the above advertisement

cut

In graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets. Any cut determines a cut-set, the set of edges that have one endpoint in each subset of the partition. These edges are said to cross the cut. In a connected graph, each cut-set determines a unique cut, and in some cases cuts are identified with their cut-sets rather than with their vertex partitions.
In a flow network, an s–t cut is a cut that requires the source and the sink to be in different subsets, and its cut-set only consists of edges going from the source's side to the sink's side. The capacity of an s–t cut is defined as the sum of capacity of each edge in the cut-set.

View More On Wikipedia.org

    Recent Content Tagged With cut

  1. Albert
  2. theandroids
  3. 3_fall
  4. JD85
  5. jamesbond
  6. callatiler
  7. Jock McG
  8. Bathfix Bob
  9. Grime
  10. Paul Slade
  11. Lyssi
  12. Dan
  • Find a Tiler Post a Job Ask a Question Tile Events Tile Pics Blog Adhesive Poll Handy Downloads