GraphUtilities`
GraphUtilities`

# MinCut

As of Version 10, all the functionality of the GraphUtilities package is built into the Wolfram System. »

MinCut[g,k]

partitions the undirected graph g into k parts where the number of edge cuts is approximately minimized.

# Details

• MinCut functionality is now available in the built-in Wolfram Language function FindGraphPartition.
• To use MinCut, you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].
• MinCut treats the input as an undirected graph, and tries to find a partition of the vertices into k parts so that each part has roughly the same number of vertices, and so that the number of edges between these parts (known as the edge separator) is minimized.

# Examples

## Basic Examples(2)

This defines a small graph:

This partitions the vertices into two parts with the minimum number of edge cuts:

MinCut has been superseded by FindGraphPartition:

Wolfram Research (2007), MinCut, Wolfram Language function, https://reference.wolfram.com/language/GraphUtilities/ref/MinCut.html.

#### Text

Wolfram Research (2007), MinCut, Wolfram Language function, https://reference.wolfram.com/language/GraphUtilities/ref/MinCut.html.

#### BibTeX

@misc{reference.wolfram_2021_mincut, author="Wolfram Research", title="{MinCut}", year="2007", howpublished="\url{https://reference.wolfram.com/language/GraphUtilities/ref/MinCut.html}", note=[Accessed: 21-June-2021 ]}

#### BibLaTeX

@online{reference.wolfram_2021_mincut, organization={Wolfram Research}, title={MinCut}, year={2007}, url={https://reference.wolfram.com/language/GraphUtilities/ref/MinCut.html}, note=[Accessed: 21-June-2021 ]}

#### CMS

Wolfram Language. 2007. "MinCut." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/GraphUtilities/ref/MinCut.html.

#### APA

Wolfram Language. (2007). MinCut. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/GraphUtilities/ref/MinCut.html