Skip to search formSkip to main contentSkip to account menu

Cut (graph theory)

Known as: Cutset, Sparsest cut problem, Cut 
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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

36 relations
2-satisfiabilityBasis (linear algebra)Betweenness centralityBridge (graph theory)

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
A wireless sensor network can get separated into multiple connected components due to the failure of some of its nodes, which is… 
Highly Cited
2010
Highly Cited
2010
Nugget-Cut: A Segmentation Scheme for Spherically- and Elliptically-Shaped 3D Objects
In this paper, a segmentation method for spherically-and elliptically-shaped objects is presented. It utilizes a user-defined… 
Highly Cited
2010
Highly Cited
2010
A Two-Stage Correlation Method for Stereoscopic Depth Estimation
The computation of stereoscopic depth is an important field of computer vision. Although a large variety of algorithms has been… 
2009
2009
SDP Integrality Gaps with Local̀ 1-Embeddability Subhash Khot
We construct integrality gap instances for SDP relaxation of the M AXI UM CUT and the SPARSEST CUT problems. If the triangle… 
Highly Cited
2009
Highly Cited
2009
SDP Integrality Gaps with Local ell_1-Embeddability
We construct integrality gap instances for SDP relaxation of the Maximum Cut and the Sparsest Cut problems. It is well-known that… 
2008
2008
Silhouette extraction based on iterative spatio-temporal local color transformation and graph-cut segmentation
We propose an iterative scheme of spatio-temporal local color transformation of background and graph-cut segmentation for… 
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
This work proposes a new method for choosing the best transmission system expansion plan for the highest satisfaction level of… 
Highly Cited
1991
Highly Cited
1991
CAREL: Computer Aided Reliability Evaluator for Distributed Computing Networks
  • S. SohS. 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… 
Highly Cited
1987
Highly Cited
1987
SYREL: A Symbolic Reliability Algorithm Based on Path and Cutset Methods
Symbolic terminal reliability algorithms are important for analysis and synthesis of computer networks. In this paper, we present… 
Highly Cited
1987
Highly Cited
1987
Mapping DNA by stochastic relaxation
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)