Minimum cut

Known as: Min cut, Min-cut, Mincut 
In graph theory, a minimum cut of a graph is a cut (a partition of the vertices of a graph into two disjoint subsets that are joined by at least one… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1974-2018
05010019742018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
We study the problem of computing approximate minimum edge cuts by distributed algorithms. We present two randomized… (More)
  • figure 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We consider the task of unsupervised lecture segmentation. We formalize segmentation as a graph-partitioning task that optimizes… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
In this paper, we introduce simple graph clustering methods based on minimum cuts within the graph. The clustering methods are… (More)
  • figure 2
  • figure 3
  • figure 4
  • table 1
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in… (More)
  • figure 1
  • figure 2
  • table 3
  • table 6
  • figure 3
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Minimum cut/maximum flow algorithms on graphs have emerged as an increasingly useful tool for exactor approximate energy… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Recently, several new algorithms have been developed for the minimum cut problem. These algorithms are very different from the… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1996
Highly Cited
1996
This paper present a new approach to finding minimum cuts in undirected graphs. The fundamental principle is simple: the edges in… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 1
  • figure 5
Is this relevant?
Highly Cited
1975
Highly Cited
1975
This paper is concerned with an integer progranming characterization of a cut i n a network. provides a fundamentat equivalence… (More)
  • figure 1
  • figure 1
  • figure 2
Is this relevant?