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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Hager, W.W., Hungerford, J.T.: Continuous quadratic programming formulations of optimization problems on graphs. European J. Oper. Res. (2013). http://dx.doi.org/10.1016/j.ejor.2014.05.042
Balas, E., de Souza, C.C.: The vertex separator problem: a polyhedral investigation. Math. Program. 103, 583–608 (2005)
Pothen, A., Simon, H.D., Liou, K.: Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11(3), 430–452 (1990)
Ullman, J.: Computational Aspects of VLSI. Computer Science Press, Rockville (1984)
Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49, 291–307 (1970)
Bui, T., Jones, C.: Finding good approximate vertex and edge partitions is NP-hard. Inf. Process. Lett. 42, 153–159 (1992)
Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: Proceedings of the 19th Design Automation Conference Las Vegas, NV, pp. 175–181 (1982)
Feige, U., Hajiaghayi, M., Lee, J.: Improved approximation algorithms for vertex separators. SIAM J. Comput. 38, 629–657 (2008)
Ron, D., Safro, I., Brandt, A.: Relaxation-based coarsening and multiscale graph organization. Multiscale Model. Simul. 9(1), 407–423 (2011)
Buluc, A., Meyerhenke, H., Safro, I., Sanders, P., Schulz, C.: Recent advances in graph partitioning (2013) arXiv:1311.3144
Leiserson, C., Lewis, J.: Orderings for parallel sparse symmetric factorization. In: Third SIAM Conference on Parallel Processing for Scientific Computing, pp. 27–31 (1987)
Safro, I., Ron, D., Brandt, A.: A multilevel algorithm for the minimum 2-sum problem. J. Graph Algorithms Appl. 10, 237–258 (2006)
Dezső, B., Jüttner, A., Kovács, P.: Lemon - an open source C++ graph template library. Electron. Notes Theoret. Comput. Sci. 264(5), 23–45 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Hager, W.W., Hungerford, J.T., Safro, I. (2014). A Continuous Refinement Strategy for the Multilevel Computation of Vertex Separators. In: Pardalos, P., Resende, M., Vogiatzis, C., Walteros, J. (eds) Learning and Intelligent Optimization. LION 2014. Lecture Notes in Computer Science(), vol 8426. Springer, Cham. https://doi.org/10.1007/978-3-319-09584-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-09584-4_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09583-7
Online ISBN: 978-3-319-09584-4
eBook Packages: Computer ScienceComputer Science (R0)