The vertex separator problem: Algorithms and computations

Mathematical Programming

Volumn 103, Issue 3, 2005, Pages 609-631

  De Souza, Cid ^a   Balas, Egon ^b  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; GRAPH THEORY; INTEGER PROGRAMMING; POLYNOMIALS; SET THEORY; VECTORS;

BRANCH-AND-CUT ALGORITHM; MIXED INTEGER PROGRAMMING; POLYHEDRAL STUDIES; VERTEX SEPARATORS;

PROBLEM SOLVING;

EID: 21644438506     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-005-0573-8     Document Type: Article

References (6)

1. Balls, E., de Souza, C.: The Vertex Separator Problem: A Polyhedral Investigation. Math. Programming 103, 583-608 (2005)
2. Lipton, R.J., Tarjan, R.J.: A Separator Theorem for Planar Graphs. SIAM Journal on Applied Math. 36, 177-189 (1979)
3. George, J.A.: Nested dissection of a nested finite element mesh. SIAM J. Numerical Anal. 10, 1973 345-367.
4. http://mat.gsia.cmu.edu/COLOR/instances.html
5. http://math.nist.gov/MatrixMarket
6. http://www.ic.unicamp.br/~cid/Problem-instances/VSP.html