Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,475,400 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.
Highly Cited
2013
Highly Cited
2013
Location-Based Crowdsourcing for Vehicular Communication in Hybrid Networks
Di Wu
,
Yuan Zhang
,
L. Bao
,
A. Regan
IEEE transactions on intelligent transportation…
2013
Corpus ID: 14195375
It is a challenge to design efficient routing protocols for vehicular ad hoc networks (VANETs) because of their highly dynamic…
Expand
2010
2010
Algebraic network coding approach to deterministic wireless relay networks
Minji Kim
,
M. Médard
Allerton Conference on Communication, Control…
2010
Corpus ID: 23871
The deterministic wireless relay network model, introduced by Avestimehr et al., has been proposed for approximating Gaussian…
Expand
Highly Cited
2009
Highly Cited
2009
Network coding-based protection of many-to-one wireless flows
Osameh M. Al-Kofahi
,
A. Kamal
IEEE Journal on Selected Areas in Communications
2009
Corpus ID: 10248870
This paper addresses the problem of survivability of many-to-one flows in wireless networks, such as wireless mesh networks (WMNs…
Expand
Highly Cited
2006
Highly Cited
2006
Automatic Image Segmentation by Positioning a Seed
Branislav Micusík
,
A. Hanbury
European Conference on Computer Vision
2006
Corpus ID: 14045261
We present a method that automatically partitions a single image into non-overlapping regions coherent in texture and colour. An…
Expand
Highly Cited
2005
Highly Cited
2005
Amplify-forward and decode-forward: the impact of location and capacity contour
Meng Yu
,
Jing Li
,
H. Sadjadpour
IEEE Military Communications Conference
2005
Corpus ID: 12251200
Successful message relay, or the quality of the inter-user channel, is critical to fully realize the cooperative benefits…
Expand
Highly Cited
2004
Highly Cited
2004
A routing framework for providing robustness to node failures in mobile ad hoc networks
Zhenqiang Ye
,
S. Krishnamurthy
,
S. Tripathi
Ad hoc networks
2004
Corpus ID: 18056931
1998
1998
A Randomized Algorithm for Pairwise Clustering
Yoram Gdalyahu
,
D. Weinshall
,
M. Werman
Neural Information Processing Systems
1998
Corpus ID: 967682
We present a stochastic clustering algorithm based on pairwise similarity of datapoints. Our method extends existing…
Expand
Highly Cited
1991
Highly Cited
1991
CAREL: Computer Aided Reliability Evaluator for Distributed Computing Networks
S. Soh
,
S. Rai
IEEE Trans. Parallel Distributed Syst.
1991
Corpus ID: 1132635
An efficient method to compute the terminal reliability (the probability of communication between a pair of nodes) of a…
Expand
Highly Cited
1990
Highly Cited
1990
Continuous-Time Flows in Networks
A. Philpott
Mathematics of Operations Research
1990
Corpus ID: 39092506
We consider a class of maximum flow problems formulated in a directed network where the arc flows vary as Lebesgue-measurable…
Expand
Highly Cited
1982
Highly Cited
1982
A Combined Force and Cut Algorithm for Hierarchical VLSI Layout
G. J. Wipfler
,
M. Wiesel
,
D. Mlynski
Design Automation Conference
1982
Corpus ID: 18262590
This paper presents a new algorithm for the initial placement of hierarchical VLSI circuits. The components to be placed are…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE