Skip to content
#

minimum

Here are 173 public repositories matching this topic...

GraphOrdering.jl is a package focused on a problem of renumbering vertices of a graph such a way that the bandwidth of the sparse matrix is minimized. In other words: find a permutation of system of equations which minimized the fill-in of sparse matrix during matrix factorization. The functionality of the package corresponds to the symrcm funct…

  • Updated Apr 16, 2020
  • Julia

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 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 topic, visit your repo's landing page and select "manage topics."

Learn more