Browsing Mathematics (Faculty of) by Subject "Graph Partitioning"
Now showing items 1-2 of 2
-
ADMM for SDP Relaxation of GP
(University of Waterloo, 2016-08-30)We consider the problem of partitioning the set of nodes of a graph G into k sets of given sizes in order to minimize the cut obtained after removing the k-th set. This is a variant of the well-known vertex separator ... -
Eigenvalue, Quadratic Programming and Semidefinite Programming Bounds for Graph Partitioning Problems
(University of Waterloo, 2014-09-03)The Graph Partitioning problems are hard combinatorial optimization problems. We are interested in both lower bounds and upper bounds. We introduce several methods including basic eigenvalue and projected eigenvalue ...