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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
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
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
The computation of stereoscopic depth is an important field of computer vision. Although a large variety of algorithms has been… 
2009
2009
We construct integrality gap instances for SDP relaxation of the M AXI UM CUT and the SPARSEST CUT problems. If the triangle… 
Highly Cited
2005
Highly Cited
2005
This work proposes a new method for choosing the best transmission system expansion plan for the highest satisfaction level of… 
Highly Cited
2003
Highly Cited
2003
SummaryA phenomenon commonly encountered during machining operations is chatter. It manifests itself as a vibration between… 
2002
2002
  • N. XuN. Ahuja
  • 2002
  • Corpus ID: 12210980
In this paper, we present an object contour tracking approach using graph cuts based active contours (GCBAC). Our proposed… 
Highly Cited
1991
Highly Cited
1991
  • S. SohS. Rai
  • 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
Symbolic terminal reliability algorithms are important for analysis and synthesis of computer networks. In this paper, we present… 
Highly Cited
1986
Highly Cited
1986