Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,843,406 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
22 relations
Approximate max-flow min-cut theorem
Closure problem
Cut (graph theory)
Dual graph
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Two-unicast is hard
Sudeep Kamath
,
David Tse
,
Chih-Chun Wang
IEEE International Symposium on Information…
2014
Corpus ID: 12584188
Consider the k-unicast network coding problem over an acyclic wireline network: Given a rate vector k-tuple, determine whether…
Expand
2009
2009
Speeding Up FPGA Placement via Partitioning and Multithreading
Cristinel Ababei
International Journal of Reconfigurable Computing
2009
Corpus ID: 39794702
One of the current main challenges of the FPGA design flow is the long processing time of the placement and routing algorithms…
Expand
2009
2009
Improving the multicommodity flow rates with network codes for two sources
Elona Erez
,
M. Feder
IEEE Journal on Selected Areas in Communications
2009
Corpus ID: 12467691
In this work we introduce a construction and analysis of network codes for two sources. The region of achievable rates for this…
Expand
2008
2008
Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design
K. Sreeram
,
B. Sasidharan
,
P. V. Kumar
arXiv.org
2008
Corpus ID: 5560849
We consider single-source single-sink (ss-ss) multi-hop relay networks, with slow-fading links and single-antenna half-duplex…
Expand
2003
2003
On Energy Efficiency and Optimum Resource Allocation of Relay Transmissions
Yingwei Yao
,
Xiaodong Cai
,
G. Giannakis
2003
Corpus ID: 18594773
The location of an air supply in a combustion apparatus is made adjustable by changing the point of intersection of a slot in a…
Expand
1994
1994
FPGA partitioning for critical paths
D. Brasen
,
G. Saucier
Proceedings of European Design and Test…
1994
Corpus ID: 10152319
FPGA packages have maximum size constraints much larger than the number of IO pins. The resulting IO bottleneck during circuit…
Expand
1992
1992
Randomized Heuristics for the Mapping Problem
S. Arunkumar
,
T. Chockalingam
International journal of high speed computing
1992
Corpus ID: 44960036
The combinatorial optimization problem of assigning parallel tasks onto a multiprocessor so as to minimize the execution time is…
Expand
1990
1990
Minimum Cuts for Circular-Arc Graphs
D. T. Lee
,
M. Sarrafzadeh
,
Ying-Fung Wu
SIAM journal on computing (Print)
1990
Corpus ID: 27844710
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…
Expand
1989
1989
Comments on 'Fundamental conditions governing TDM switching assignments in terrestrial and satellite networks' [by K.Y. Eng and A.S. Acampora]
S. Liew
IEEE Transactions on Communications
1989
Corpus ID: 41760849
The problem in the above paper (see ibid., vol.COM-35, p.755-61, July 1987) is formulated in terms of a max-flow network problem…
Expand
1984
1984
Graphs with the smallest number of minimum cut sets
Derek H. Smith
Networks
1984
Corpus ID: 44784841
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…
Expand