Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,761 papers from all fields of science
Search
Sign In
Create Free Account
Cut (graph theory)
Known as:
Cutset
, Sparsest cut problem
, Cut
Expand
In graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets. Any cut determines a cut-set, the set of edges that have…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
36 relations
2-satisfiability
Basis (linear algebra)
Betweenness centrality
Bridge (graph theory)
Expand
Broader (1)
Combinatorial optimization
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Cut Detection in Wireless Sensor Networks
P. Barooah
,
H. Chenji
,
R. Stoleru
,
T. Kalmár-Nagy
IEEE Transactions on Parallel and Distributed…
2012
Corpus ID: 14336715
A wireless sensor network can get separated into multiple connected components due to the failure of some of its nodes, which is…
Expand
Highly Cited
2010
Highly Cited
2010
Nugget-Cut: A Segmentation Scheme for Spherically- and Elliptically-Shaped 3D Objects
J. Egger
,
M. Bauer
,
+4 authors
C. Nimsky
DAGM-Symposium
2010
Corpus ID: 43145854
In this paper, a segmentation method for spherically-and elliptically-shaped objects is presented. It utilizes a user-defined…
Expand
Highly Cited
2010
Highly Cited
2010
A Two-Stage Correlation Method for Stereoscopic Depth Estimation
Nils Einecke
,
J. Eggert
International Conference on Digital Image…
2010
Corpus ID: 13543695
The computation of stereoscopic depth is an important field of computer vision. Although a large variety of algorithms has been…
Expand
2009
2009
SDP Integrality Gaps with Local̀ 1-Embeddability Subhash Khot
Subhash Khot
,
Rishi Saket
2009
Corpus ID: 16089298
We construct integrality gap instances for SDP relaxation of the M AXI UM CUT and the SPARSEST CUT problems. If the triangle…
Expand
Highly Cited
2005
Highly Cited
2005
A fuzzy branch and bound-based transmission system expansion planning for the highest satisfaction level of the decision maker
Jaeseok Choi
,
A. El-Keib
,
T. Tran
IEEE Transactions on Power Systems
2005
Corpus ID: 29824867
This work proposes a new method for choosing the best transmission system expansion plan for the highest satisfaction level of…
Expand
Highly Cited
2003
Highly Cited
2003
Spindle Speed Variation for the Suppression of Regenerative Chatter
N. Namachchivaya
,
R. Beddini
Journal of nonlinear science
2003
Corpus ID: 43231814
SummaryA phenomenon commonly encountered during machining operations is chatter. It manifests itself as a vibration between…
Expand
2002
2002
Object contour tracking using graph cuts based active contours
N. Xu
,
N. Ahuja
Proceedings. International Conference on Image…
2002
Corpus ID: 12210980
In this paper, we present an object contour tracking approach using graph cuts based active contours (GCBAC). Our proposed…
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
1987
Highly Cited
1987
SYREL: A Symbolic Reliability Algorithm Based on Path and Cutset Methods
S. Hariri
,
C. Raghavendra
IEEE transactions on computers
1987
Corpus ID: 9001045
Symbolic terminal reliability algorithms are important for analysis and synthesis of computer networks. In this paper, we present…
Expand
Highly Cited
1986
Highly Cited
1986
A fuzzy expert system
J. Buckley
,
W. Siler
,
D. Tucker
1986
Corpus ID: 62534250
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
or Only Accept Required