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)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- Mohsen Ghaffari, Fabian Kuhn
- DISC
- 2013

We study the problem of computing approximate minimum edge cuts by distributed algorithms. We present two randomizedâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Igor Malioutov, Regina Barzilay
- ACL
- 2006

We consider the task of unsupervised lecture segmentation. We formalize segmentation as a graph-partitioning task that optimizesâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Gary William Flake, Robert E. Tarjan, Kostas Tsioutsiouliklis
- Internet Mathematics
- 2003

In this paper, we introduce simple graph clustering methods based on minimum cuts within the graph. The clustering methods areâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Vladimir Kolmogorov, Ramin Zabih
- IEEE Transactions on Pattern Analysis and Machineâ€¦
- 2002

In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems inâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Yuri Boykov, Vladimir Kolmogorov
- IEEE Transactions on Pattern Analysis and Machineâ€¦
- 2001

Minimum cut/maximum flow algorithms on graphs have emerged as an increasingly useful tool for exactor approximate energyâ€¦Â (More)

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)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- David R. Karger, Clifford Stein
- J. ACM
- 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

- David R. Karger
- STOC
- 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

- Mechthild Stoer, Frank Wagner
- ESA
- 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)

Is this relevant?

Highly Cited

1975

Highly Cited

1975

- Jean-Claude Picard, H. Donald Ratliff
- Networks
- 1975

This paper is concerned with an integer progranming characterization of a cut i n a network. provides a fundamentat equivalenceâ€¦Â (More)

Is this relevant?