# Vertex separator

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Review

2018

Review

2018

- Comp. Opt. and Appl.
- 2018

We consider graph three-partitions with the objective of minimizing the number of edges between the first two partition setsâ€¦Â (More)

Is this relevant?

2018

2018

- Comp. Opt. and Appl.
- 2018

The Vertex Separator Problem for a graph is to find the smallest collection of vertices whose removal breaks the graph into twoâ€¦Â (More)

Is this relevant?

2017

2017

- Expert Syst. Appl.
- 2017

This paper presents the first population-based path relinking algorithm for solving the NP-hard vertex separator problem inâ€¦Â (More)

Is this relevant?

2015

2015

- 2015

Let G = (V âˆª T, E) be an undirected graph such that V is a set of vertices, E a set of edges and T a set of terminal verticesâ€¦Â (More)

Is this relevant?

2013

2013

- IJCAI
- 2013

In this paper, we propose the first heuristic approach for the vertex separator problem (VSP), based on Breakout Local Searchâ€¦Â (More)

Is this relevant?

2013

2013

- 2013

The Vertex Separator Problem (VSP) for a graph is to find the smallest collection of vertices whose removal breaks the graph intoâ€¦Â (More)

Is this relevant?

2011

2011

- J. Global Optimization
- 2011

Given G = (V,E) a connected undirected graph and a positive integer Î²(|V |), the vertex sperator problem is to find a partitionâ€¦Â (More)

Is this relevant?

2010

2010

- ArXiv
- 2010

The modeling flexibility provided by hypergraphs has drawn a lot of interest from the combinatorial scientific community, leadingâ€¦Â (More)

Is this relevant?

2006

2006

- STOC
- 2006

Let G be an n-vertex graph that has a vertex separator of size k that partitions the graph into connected components of sizeâ€¦Â (More)

Is this relevant?

2005

2005

- Math. Program.
- 2005

This is a companion paper to our polyhedral study [1] of the Vertex Separator (VS) Problem. Given an undirected graph G, the VSâ€¦Â (More)

Is this relevant?