Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

17 relations
Caterpillar treeClique (graph theory)Connected component (graph theory)Cut (graph theory)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Connected (s, t)-Vertex Separator Parameterized by Chordality
We investigate the complexity of nding a minimum connected ( s;t)vertex separator ((s;t)-CVS) and present an interesting… 
2012
2012
Partial cuts in attack graphs for cost effective network defence
Because of increasing vulnerabilities, maturing attack tools, and increasing dependence on computer network infrastructure, tools… 
2012
2012
EVIDENCE FOR MULTIPLE FLUID PULSES IN THE CM 1 CARBONACEOUS CHONDRITE PARENT
Introduction: The CM carbonaceous chondrites have been aqueousely altered to various degrees to produce a range of secondary… 
2011
2011
Hypergraph Partitioning through Vertex Separators on Graphs
The modeling flexibility provided by hypergraphs has drawn a lot of interest from the combinatorial scientific community, leading… 
2009
2009
From Pulpits to Polls: How Female Preachers Birthed the Women's Rights Movement
Women sought the right to share their sacred voices in a variety of situations in the New World. The developing theology of… 
2009
2009
Recognizing Intrusive Intention and Assessing Threat Based on Attack Path Analysis
Intention recognition is the ability to predict an opposing force's high level goals. Knowing an attacker's intention can support… 
2008
2008
Diameter-sufficient conditions for a graph to be super-restricted connected
2005
2005
Cuts leaving components of given minimum order
1984
1984
Graphs with the smallest number of minimum cut sets
The number of vertex cut sets of size k in a graph of connectivity k has been used as a measure of network reliability. Let G be… 
1973
1973
On the design of reliable networks
This paper is concerned with construction of graphs, with n vertices and m edges, whose connectivity r = [2m/n] ≧ 3, and have no… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)