# K-vertex-connected graph

## Papers overview

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

2017

2017

- ArXiv
- 2017

Cohesive subgraph detection is an important graph problem that is widely applied in many application domains, such as socialâ€¦Â (More)

Is this relevant?

2015

2015

- PODS
- 2015

A growing body of work addresses the challenge of processing dynamic graph streams: a graph is defined by a sequence of edgeâ€¦Â (More)

Is this relevant?

2010

2010

- Algorithmica
- 2010

We present an algorithm for testing the k-vertex-connectivity of graphs with the given maximum degree. The time complexity of theâ€¦Â (More)

Is this relevant?

2010

2010

- J. Comb. Optim.
- 2010

Given a k-connected graph G = (V ,E) and V â€² âŠ‚ V , k-Vertex-Connected Subgraph Augmentation Problem (k-VCSAP) is to find S âŠ‚ Vâ€¦Â (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- PVLDB
- 2009

The goal of graph clustering is to partition vertices in a large graph into different clusters based on various criteria such asâ€¦Â (More)

Is this relevant?

2002

2002

- STOC
- 2002

(MATH) We present two new algorithms for the problem of finding a minimum-cost k-vertex connected spanning subgraph. The firstâ€¦Â (More)

Is this relevant?

1999

1999

- 1999

Complexes of (not) connected graphs, hypergraphs and their homology appear in the construction of knot invariants given by Vâ€¦Â (More)

Is this relevant?

1994

1994

- Discrete Mathematics
- 1994

We study the k-diameter of k-regular k-connected graphs. Among other results, we show that every k-regular k-connected graph on nâ€¦Â (More)

Is this relevant?

1991

1991

- STOC
- 1991

A certificate for the k-vertex connectivity of a graph G = (V, E) is a subset Eâ€™ of E such that (V, Eâ€™) is k-vertex connected iffâ€¦Â (More)

Is this relevant?

1981

1981

- Journal of Graph Theory
- 1981

We show that every k-connected graph with no 3-cycle contains an edge whose contraction results in a k-connected graph and useâ€¦Â (More)

Is this relevant?