Vertex separator

Known as: Separator, Vertex cut 
In graph theory, a vertex subset is a vertex separator (or vertex cut, separating set) for nonadjacent vertices and if the removal of from the graph… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
We consider graph three-partitions with the objective of minimizing the number of edges between the first two partition sets… (More)
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2018
2018
The Vertex Separator Problem for a graph is to find the smallest collection of vertices whose removal breaks the graph into two… (More)
  • table 4.1
  • table 7.1
  • table 7.2
  • table 7.3
  • table 7.4
Is this relevant?
2017
2017
This paper presents the first population-based path relinking algorithm for solving the NP-hard vertex separator problem in… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
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)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
2013
2013
In this paper, we propose the first heuristic approach for the vertex separator problem (VSP), based on Breakout Local Search… (More)
  • table 1
  • table 2
Is this relevant?
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)
  • table 4.1
Is this relevant?
2011
2011
Given G = (V,E) a connected undirected graph and a positive integer β(|V |), the vertex sperator problem is to find a partition… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2010
2010
The modeling flexibility provided by hypergraphs has drawn a lot of interest from the combinatorial scientific community, leading… (More)
  • figure 3.1
  • figure 3.2
  • figure 3.3
  • figure 3.4
  • figure 3.5
Is this relevant?
2006
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
This is a companion paper to our polyhedral study [1] of the Vertex Separator (VS) Problem. Given an undirected graph G, the VS… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?