50 citations · 234 across the 24 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
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…