Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,079,173 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.
2014
2014
Robust Semi-Automatic Depth Map Generation in Unconstrained Images and Video Sequences for 2D to Stereoscopic 3D Conversion
Raymond Phan
,
D. Androutsos
IEEE transactions on multimedia
2014
Corpus ID: 5928873
We describe a system for robustly estimating synthetic depth maps in unconstrained images and videos, for semi-automatic…
Expand
2014
2014
Data density based clustering
Richard Hyde
,
P. Angelov
UK Workshop on Computational Intelligence
2014
Corpus ID: 12521160
A new, data density based approach to clustering is presented which automatically determines the number of clusters. By using RDE…
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
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
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
2009
2009
Expansion of Calamagrostis villosa in sub-alpine Nardus stricta grassland: cessation of cutting management or high nitrogen deposition?
M. Hejcman
,
M. Klaudisová
,
P. Hejcmanová
,
V. Pavlů
,
Martin J. Jones
2009
Corpus ID: 55282785
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
2002
2002
Treatment of general dependencies in system fault-tree and risk analysis
J. Vaurio
IEEE Transactions on Reliability
2002
Corpus ID: 44361206
Implicit and explicit methods are described for reliability and risk analysis of systems with dependent or correlated basic…
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
1982
Highly Cited
1982
Determination of All Minimal Cut-Sets between a Vertex Pair in an Undirected Graph
U. Abel
,
R. Bicker
IEEE Transactions on Reliability
1982
Corpus ID: 36282553
An efficient enumeration algorithm generates all minimal cut-sets separating a special vertex pair in an undirected graph. The…
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