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…

Papers overview

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

2012

Because of increasing vulnerabilities, maturing attack tools, and increasing dependence on computer network infrastructure, tools…

2012

Introduction: The CM carbonaceous chondrites have been aqueousely altered to various degrees to produce a range of secondary…

2011

The modeling flexibility provided by hypergraphs has drawn a lot of interest from the combinatorial scientific community, leading…

2010

For a connected graph G, a vertex subset F ⊂ V (G) is a cyclic vertex-cut of G if G - F is disconnected and at least two of its…

2009

Women sought the right to share their sacred voices in a variety of situations in the New World. The developing theology of…

2009

Intention recognition is the ability to predict an opposing force's high level goals. Knowing an attacker's intention can support…

2005

1995

This paper presents insertions-only algorithms for maintaining the exact and approximate size of the minimum edge cut and the…

1984

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…

1978

A graph G is critically 2-connected if G is 2-connected but, for any point p of G, G — p is not 2-connected. Critically 2…