A Continuous Refinement Strategy for the Multilevel Computation of Vertex Separators

William W Hager,James T Hungerford,Ilya Safro

doi:10.1007/978-3-319-09584-4_8

A Continuous Refinement Strategy for the Multilevel Computation of Vertex Separators

William W Hager, James T Hungerford + Show 1 more

Open Access

https://doi.org/10.1007/978-3-319-09584-4_8

Copy DOI

Publication Date: Jan 1, 2014

Citations: 11

Affiliation: University of Florida, Clemson University

#Vertex Separator Problem #Vertex Separator + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

AbstractThe 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.KeywordsVertex Separator Problem (VSP)Bilinear ProgramMultilevel SchemeCoarse GraphBalanced Graph PartitioningThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Full Text