A Continuous Refinement Strategy for the Multilevel Computation of Vertex Separators
Data Structures and Algorithms
2013-11-26 v1
Abstract
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 equal size. Recently, Hager and Hungerford [1] developed a continuous bilinear programming formulation of the VSP. In this paper, we reinforce the bilinear programming approach with a multilevel scheme for learning the structure of the graph.
Keywords
Cite
@article{arxiv.1311.5930,
title = {A Continuous Refinement Strategy for the Multilevel Computation of Vertex Separators},
author = {William Hager and James Hungerford and Ilya Safro},
journal= {arXiv preprint arXiv:1311.5930},
year = {2013}
}