3 papers
math.OC2017
A General Regularized Continuous Formulation for the Maximum Clique Problem
James T. Hungerford, Francesco Rinaldi
In this paper, we develop a general regularization-based continuous optimization framework for the maximum clique problem. In particular, we consider a broad class of regularizatio…
cs.DS2014
A Multilevel Bilinear Programming Algorithm For the Vertex Separator Problem
William W. Hager, James T. Hungerford, Ilya Safro
The Vertex Separator Problem for a graph is to find the smallest collection of vertices whose removal breaks the graph into two disconnected subsets that satisfy specified size con…
cs.DS2013
A Continuous Refinement Strategy for the Multilevel Computation of Vertex Separators
William Hager, James Hungerford, Ilya Safro
The Vertex Separator Problem (VSP) on a graph is the problem of finding the smallest collection of vertices whose removal separates the graph into two disjoint subsets of roughly e…