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…

Papers overview

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

2014

Consider the k-unicast network coding problem over an acyclic wireline network: Given a rate vector k-tuple, determine whether…

2009

In this work we introduce a construction and analysis of network codes for two sources. The region of achievable rates for this…

2008

Submodular functions occur in many combinatorial optimisation problems and a number of polynomial-time algorithms have been…

2003

In computer-aided design, partitioning is the task of clustering objects into groups so that a given objective function is…

1994

FPGA packages have maximum size constraints much larger than the number of IO pins. The resulting IO bottleneck during circuit…

1993

Many optimization algorithms involve repeated processing of a fixed set of linear constraints. If the constraint matrix A is…

1992

The combinatorial optimization problem of assigning parallel tasks onto a multiprocessor so as to minimize the execution time is…

1990

The problem of finding a minimum cut of n arcs on a unit circle is considered. It is shown that this problem can be solved in…

1984

The number of vertex cut sets of size k in a graph of connectivity k has been used as a measure of network reliability. Let G be…

1968

In Opns. Res. 14, 377–387 (1966) a max-flow min-cut theorem for two-commodity flows in Euler networks with integer capacities is…