OurBigBook.comSite Source code

Cut of a graph

A cut is a partition

V = A ⊔ B

of the vertex set. Its size is the number of edges with one endpoint in each part.

Table of contents 180 5
- Maximum cut Cut of a graph 13
- Unfriendly partition of a graph Cut of a graph 143 3

 Ancestors (5)

 Incoming links (1)

Solution