Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,281,963 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.
2015
2015
UPGMpp: a Software Library for Contextual Object Recognition
J. Ruiz-Sarmiento
,
C. Galindo
,
J. González-Jiménez
2015
Corpus ID: 15322049
Universidad de Malaga. Campus de Excelencia Internacional Andalucia Tech. Spanish grant program FPU-MICINN 2010 and the Spanish…
Expand
2011
2011
Object detection by parts using appearance, structural and shape features
Li He
,
Hui Wang
,
Hong Zhang
IEEE International Conference on Mechatronics and…
2011
Corpus ID: 16213153
This paper proposes a novel object detection algorithm with the combination of appearance, structural and shape features. We…
Expand
2011
2011
Making the right moves: Guiding alpha-expansion using local primal-dual gaps
Dhruv Batra
,
Pushmeet Kohli
Computer Vision and Pattern Recognition
2011
Corpus ID: 2494792
This paper presents a new adaptive graph-cut based move-making algorithm for energy minimization. Traditional move-making…
Expand
Highly Cited
2010
Highly Cited
2010
On the Existence of Optimal Exact-Repair MDS Codes for Distributed Storage
Changho Suh
,
K. Ramchandran
arXiv.org
2010
Corpus ID: 446762
The high repair cost of (n,k) Maximum Distance Separable (MDS) erasure codes has recently motivated a new class of codes, called…
Expand
2010
2010
MRI brain image segmentation using graph cuts
M. Khadem
2010
Corpus ID: 14553500
2
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
2004
2004
Diversity gains and clustering in wireless relaying
Melda Yuksel
,
E. Erkip
International Symposium onInformation Theory…
2004
Corpus ID: 17379836
We consider a wireless system consisting of one source, one destination and M relays. Assuming path loss and Rayleigh fading, we…
Expand
1998
1998
Deterministic approximation of marginal probabilities in Bayes nets
Eugene S. Santos
,
S. E. Shimony
IEEE Trans. Syst. Man Cybern. Part A
1998
Corpus ID: 15673818
Computation of marginal probabilities in Bayes nets is central to numerous reasoning and automatic decision-making systems. This…
Expand
1996
1996
Continuous-Valued Attributes in Fuzzy Decision Trees
J. Zeidler
,
M. Schlosser
1996
Corpus ID: 116833377
Classical crisp decision trees (DT) are widely applied to classiication tasks. Nevertheless, there is still a lot of problems…
Expand
Highly Cited
1994
Highly Cited
1994
A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures
Mayiz B. Habbal
,
H. Koutsopoulos
,
S. Lerman
Transportation Science
1994
Corpus ID: 23460528
The shortest path problem is a classical and important combinatorial problem with many applications. We examine the solution of…
Expand