Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2019
Highly Cited
2019
Natural graphs with skewed distributions raise unique challenges to distributed graph computation and partitioning. Existing… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2014
Highly Cited
2014
With the prevalence of graph data in real-world applications (e.g., social networks, mobile phone networks, web graphs, etc.) and… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2013
Highly Cited
2013
This paper addresses the problem of resilient in-network consensus in the presence of misbehaving nodes. Secure and fault… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
We present a framework that automatically produces suggestions to resolve type errors in security-typed programs, enabling legacy… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We develop the algorithmic theory of vertex separators and its relation to the embeddings of certain metric spaces. Unlike in the… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We develop the algorithmic theory of vertex separators, and its relation to the embeddings of certain metric spaces. Unlike in… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Abstract.The vertex separator (VS) problem in a graph G=(V,E) asks for a partition of V into nonempty subsets A, B, C such that… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Let G=(V,E) be a k-regular graph with connectivity @k and edge connectivity @l. G is maximum connected if @k=k, and G is maximum… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
A particle-size distribution (PSD) constitutes a fundamental soil property correlated to many other soil properties. Accurate… Expand
  • table 1
  • figure 1
  • table 2
  • figure 3
  • figure 2
Is this relevant?
Highly Cited
1986
Highly Cited
1986
shortened (strengthened). The parenthetical equivalents are justified because of the well-established correlation between bond… Expand
  • figure 1
  • table I
  • table 111
  • table IV
  • table 11
Is this relevant?