article

An exact algorithm for solving the vertex separator problem

Authors:

Mohamed Didi Biha,

Marie-Jean MeursAuthors Info & Claims

Journal of Global Optimization, Volume 49, Issue 3

Pages 425 - 434

https://doi.org/10.1007/s10898-010-9568-y

Published: 01 March 2011 Publication History

Abstract

Given G = ( V , E ) a connected undirected graph and a positive integer β (| V |), the vertex separator problem is to find a partition of V into no-empty three classes A , B , C such that there is no edge between A and B , max{| A |, | B |} β (| V |) and | C | is minimum. In this paper we consider the vertex separator problem from a polyhedral point of view. We introduce new classes of valid inequalities for the associated polyhedron. Using a natural lower bound for the optimal solution, we present successful computational experiments.

References

[1]

Balas, E., de Souza, C.: The vertex separator problem: a polyhedral investigation. Math. Program. 3(103), 583-608 (2005).

Digital Library

Google Scholar

[2]

Bui, T.N., Jones, C.: Finding good approximate vertex and edge partitions is NP-hard. Inf. Process. Lett. 42 , 153-159 (1992).

Digital Library

Google Scholar

[3]

Cherkassky, B.V., Goldberg, A.V.: On implementing Push-Relabel method for the maximum flow problem. Algorithmica 19 , 390-410 (1997).

Crossref

Google Scholar

[4]

de Souza, C., Balas, E.: The vertex separator problem: algorithms and computations. Math. Programm. 3 (103), 609-631 (2005).

Digital Library

Google Scholar

[5]

Fu, B., Oprisan, S.A., Xu, L.: Multi-Directional Width-Bounded Geometric Separator and Protein Folding. ISAAC, pp. 995-1006 (2005).

Crossref

Google Scholar

[6]

Fukuyama, J.: NP-completeness of the planar separator problems. J. Graph Algorithms Appl. 4 , 317-328 (2006).

Crossref

Google Scholar

[7]

Garey, M.R., Johnson, D.S.: Computers and Intractabiliy. W.H. Freeman and Company (1979).

Google Scholar

[8]

Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Numer. Anal. 36 , 177-189 (1979).

Google Scholar

[9]

http://www.ic.unicamp.br/~cid/Problem-instances/VSP.html

Google Scholar

[10]

http://www.avglab.com/andrew/soft.html

Google Scholar

[11]

http://www.ilog.com

Google Scholar

Cited By

View all

Irmai JZhao SSchöne MPresberger JAndres B(2024)A Graph Multi-separator Problem for Image SegmentationJournal of Mathematical Imaging and Vision10.1007/s10851-024-01201-166:5(839-872)Online publication date: 1-Oct-2024
https://dl.acm.org/doi/10.1007/s10851-024-01201-1
Hu HLi XWu J(2023)A note on the SDP relaxation of the minimum cut problemJournal of Global Optimization10.1007/s10898-022-01235-y87:2-4(857-876)Online publication date: 1-Nov-2023
https://dl.acm.org/doi/10.1007/s10898-022-01235-y
Li XPong TSun HWolkowicz H(2021)A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problemComputational Optimization and Applications10.1007/s10589-020-00261-478:3(853-891)Online publication date: 1-Apr-2021
https://dl.acm.org/doi/10.1007/s10589-020-00261-4
Show More Cited By

An exact algorithm for solving the vertex separator problem
1. Theory of computation

Recommendations

A New Lower Bound on the Size of the Smallest Vertex Separator of a Graph

Separator minimization is an important problem in graph partitioning. Although finding an optimum partitioning for a given graph is NP-hard, estimating the size of the smallest vertex separator is an interesting problem since it can be used to assess the ...
A multilevel bilinear programming algorithm for the vertex separator problem

The Vertex Separator Problem for a graph is to find the smallest collection of vertices whose removal breaks the graph into two disconnected subsets that satisfy specified size constraints. The Vertex Separator Problem was formulated in the paper ...
Note: Chordal multipartite graphs and chordal colorings

'Chordal multipartite graphs' are properly colored graphs such that two vertices in a minimal vertex separator are adjacent if and only if they are differently colored. They have induced cycle characterizations that transcend those of chordal and ...

Comments

Information & Contributors

Information

Published In

cover image Journal of Global Optimization

Journal of Global Optimization Volume 49, Issue 3

March 2011

169 pages

ISSN:0925-5001

Issue’s Table of Contents

Publisher

Kluwer Academic Publishers

United States

Publication History

Published: 01 March 2011

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Irmai JZhao SSchöne MPresberger JAndres B(2024)A Graph Multi-separator Problem for Image SegmentationJournal of Mathematical Imaging and Vision10.1007/s10851-024-01201-166:5(839-872)Online publication date: 1-Oct-2024
https://dl.acm.org/doi/10.1007/s10851-024-01201-1
Hu HLi XWu J(2023)A note on the SDP relaxation of the minimum cut problemJournal of Global Optimization10.1007/s10898-022-01235-y87:2-4(857-876)Online publication date: 1-Nov-2023
https://dl.acm.org/doi/10.1007/s10898-022-01235-y
Li XPong TSun HWolkowicz H(2021)A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problemComputational Optimization and Applications10.1007/s10589-020-00261-478:3(853-891)Online publication date: 1-Apr-2021
https://dl.acm.org/doi/10.1007/s10589-020-00261-4
Rendl FSotirov R(2018)The min-cut and vertex separator problemComputational Optimization and Applications10.1007/s10589-017-9943-469:1(159-187)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.1007/s10589-017-9943-4
Ma FWang YHao J(2017)Path relinking for the vertex separator problemExpert Systems with Applications: An International Journal10.1016/j.eswa.2017.03.06482:C(332-343)Online publication date: 1-Oct-2017
https://dl.acm.org/doi/10.1016/j.eswa.2017.03.064
Ding JLü ZZhou TXu L(2017)A quality and distance guided hybrid algorithm for the vertex separator problemComputers and Operations Research10.1016/j.cor.2016.09.01278:C(255-266)Online publication date: 1-Feb-2017
https://dl.acm.org/doi/10.1016/j.cor.2016.09.012
McCune RWeninger TMadey G(2015)Thinking Like a VertexACM Computing Surveys10.1145/281818548:2(1-39)Online publication date: 12-Oct-2015
https://dl.acm.org/doi/10.1145/2818185
Zheng XZeng DWang F(2015)Social balance in signed networksInformation Systems Frontiers10.1007/s10796-014-9483-817:5(1077-1095)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1007/s10796-014-9483-8
Benlic UHao J(2013)Breakout local search for the vertex separator problemProceedings of the Twenty-Third international joint conference on Artificial Intelligence10.5555/2540128.2540196(461-467)Online publication date: 3-Aug-2013
https://dl.acm.org/doi/10.5555/2540128.2540196

Abstract

References

Cited By

Recommendations

A New Lower Bound on the Size of the Smallest Vertex Separator of a Graph

A multilevel bilinear programming algorithm for the vertex separator problem

Note: Chordal multipartite graphs and chordal colorings

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations