Read on Wikipedia

Image: Kilom691 · CC BY-SA 3.0

Minimum cut

Minimum cut

Partition of a graph by removing fewest possible edges.

Super rare
34 views/day1 owner

No account needed. By playing, you confirm you're 13 or older and agree to the Terms of use.

1 owner

Super rareTop 12%

Category: Empty

1 owner
1 copy
1 pull
Wishlisted
0
In 0 albums
On 0 showcases
Market listings
0
Super rare1 copy

First pulled by Tryn, Nov 7, 2026

Wikipedia views per dayLast 30 days 1,210

Not sold on the market yet.

Readers' pathsAug 2026 – Oct 2026

Readers go next to

Share of the 669 clicks on its links

  1. Karger's algorithm

    Randomized algorithm for minimum cuts.

    20%

  2. Maximum cut

    Problem in graph theory.

    14%

  3. Stoer–Wagner algorithm

    Recursive algorithm in graph theory.

    13%

  4. Vertex separator

    Set of graph nodes which separate a given pair of nodes if removed.

    10%

  5. Minimum k-cut

    Combinatorial optimization graph problem.

    7.3%

Readers come from

Share of the 494 readers arriving from another article

  1. Maximum cut

    Problem in graph theory.

    20%

  2. Karger's algorithm

    Randomized algorithm for minimum cuts.

    12%