Name
Title | ||
|---|---|---|
A Continuous Refinement Strategy for the Multilevel Computation of Vertex Separators. |
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-319-09584-4_8 | LION |
DocType | Volume | Citations |
Journal | abs/1311.5930 | 0 |
PageRank | References | Authors |
0.34 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| William W. Hager | 1 | 1603 | 214.67 |
| James T. Hungerford | 2 | 11 | 1.57 |
| Ilya Safro | 3 | 226 | 25.29 |