A multilevel bilinear programming algorithm for the vertex separator problem
- 4 October 2017
- journal article
- research article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 69 (1) , 189-223
Abstract
No abstract availableKeywords
All Related Versions
This publication has 29 references indexed in Scilit:
- Optimality conditions for maximizing a function over a polyhedronMathematical Programming, 2013
- Partitioning Hypergraphs in Scientific Computing Applications through Vertex Separators on GraphsSIAM Journal on Scientific Computing, 2012
- Relaxation-Based Coarsening and Multiscale Graph OrganizationMultiscale Modeling & Simulation, 2011
- Improved Approximation Algorithms for Minimum Weight Vertex SeparatorsSIAM Journal on Computing, 2008
- Graph minimum linear arrangement by multilevel weighted edge contractionsJournal of Algorithms, 2006
- Geometric Separators for Finite-Element MeshesSIAM Journal on Scientific Computing, 1998
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular GraphsSIAM Journal on Scientific Computing, 1998
- Finding good approximate vertex and edge partitions is NP-hardInformation Processing Letters, 1992
- Partitioning Sparse Matrices with Eigenvectors of GraphsSIAM Journal on Matrix Analysis and Applications, 1990
- A parallel graph partitioning algorithm for a message-passing multiprocessorInternational Journal of Parallel Programming, 1987