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.
2014
2014
Robust Semi-Automatic Depth Map Generation in Unconstrained Images and Video Sequences for 2D to Stereoscopic 3D Conversion
We describe a system for robustly estimating synthetic depth maps in unconstrained images and videos, for semi-automatic… 
2014
2014
Data density based clustering
A new, data density based approach to clustering is presented which automatically determines the number of clusters. By using RDE… 
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… 
2009
2009
Expansion of Calamagrostis villosa in sub-alpine Nardus stricta grassland: cessation of cutting management or high nitrogen deposition?
2007
2007
Image Segmentation Using Iterated Graph Cuts Based on Multi-scale Smoothing
We present a novel approach to image segmentation using iterated Graph Cuts based on multi-scale smoothing. We compute the prior… 
2006
2006
Statistical Priors for Efficient Combinatorial Optimization Via Graph Cuts
Bayesian inference provides a powerful framework to optimally integrate statistically learned prior knowledge into numerous… 
2002
2002
Treatment of general dependencies in system fault-tree and risk analysis
Implicit and explicit methods are described for reliability and risk analysis of systems with dependent or correlated basic… 
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
1982
Highly Cited
1982
Determination of All Minimal Cut-Sets between a Vertex Pair in an Undirected Graph
An efficient enumeration algorithm generates all minimal cut-sets separating a special vertex pair in an undirected graph. The… 
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)