Skip to content
#

minimum-cut

Here are 20 public repositories matching this topic...

The Minimum Cut problem is a fundamental concept in computer science and graph theory. It involves finding the minimum number of edges that must be removed from a graph to separate the graph into two disjoint sets of vertices. The solution to this problem has important applications in various fields, such as network design, image processing, etc.

  • Updated Feb 9, 2023
  • Kotlin

Improve this page

Add a description, image, and links to the minimum-cut topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the minimum-cut topic, visit your repo's landing page and select "manage topics."

Learn more