Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,883,529 papers from all fields of science
Search
Sign In
Create Free Account
Minimum k-cut
Known as:
K-cut
, Min k-cut
In mathematics, the minimum k-cut, is a combinatorial optimization problem that requires finding a set of edges whose removal would partition the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Broader (1)
Combinatorial optimization
Gomory–Hu tree
Greedy algorithm
List of NP-complete problems
Maximum cut
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Wireless Mesh Network design by Optimization of Spectral Properties and Max-k-Cut
Veeranjaneyulu Sadhanala
2017
Corpus ID: 26408847
Topology control and channel assignment are key steps in the design of Wireless Mesh Networks (WMNs). Topology control consists…
Expand
2016
2016
Within the Outside
Sarah Mckay
2016
Corpus ID: 124573274
In my work I am using light as the subject, transformed through a unique method of photography which allows what would normally…
Expand
2016
2016
Electrical Network Approximation to Constrained Minimum k-Cut ( Multiway Cut )
Guillermo Angeris
,
Nikhil Garg
,
I. I
,
ntroduction
2016
Corpus ID: 19906695
Suppose there is a graph G = (V,E) with (weighted, symmetric) adjacency matrix A. The standard spectral clustering approach to…
Expand
2014
2014
Integrative Analysis of Dynamic Networks
Vinay Jethava
2014
Corpus ID: 41381398
Networks play a central role in several disciplines such as computational biology, social network analysis, transportation…
Expand
2011
2011
Erratum to: The capacitated max k-cut problem
D. Gaur
,
Ramesh Krishnamurti
,
R. Kohli
Mathematical programming
2011
Corpus ID: 44698816
The algorithmdescribed by the authors in a recent issue of this journal (The capacitated max k-cut problem, 115(1): 65–72 (2008…
Expand
Review
2008
Review
2008
Mesh Network Topology Construction and Channel Frequency Allocation in the TOWN Project
U. Fiedler
2008
Corpus ID: 14871921
M Me es sh h N Ne et tw wo or rk k T To op po ol lo og gy y C Co on ns st tr ru uc ct ti io on n a an nd d C Ch ha an nn ne el l…
Expand
2007
2007
4th International Workshop on Data Management for Sensor Networks (DMSN’07)
2007
Corpus ID: 18103494
In this paper, we consider a large scale sensor network comprising multiple, say K, base stations and a large number of wireless…
Expand
2006
2006
° éÕ « ÃÈk ú eO ̄ é 1 ¿ êó ° Clustering based on Graph Cuts
Thomas Zeugmann
2006
Corpus ID: 15307542
Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a…
Expand
2005
2005
Integrated routing resource assignment for RLC crosstalk minimization
Yici Cai
,
Bin Liu
,
Qiang Zhou
,
Xianlong Hong
IEEE International Symposium on Circuits and…
2005
Corpus ID: 25521671
The paper deals with the crosstalk problem for DSM designs in an integrated routing resource assignment stage containing the…
Expand
2002
2002
A Simple Branch-and-Bound Algorithm for the k-Cut Problem for Applications with k Target Vertices, e.g. VLSI Design
W. Yeh
2002
Corpus ID: 121775988
The problems studied here belong to a class called graph partition. They are combinatorial problems which consist of finding a…
Expand