K-edge-connected graph

Known as: Edge connectivity, Edge-connectivity 
In graph theory, a connected graph is k-edge-connected if it remains connected whenever fewer than k edges are removed. The edge-connectivity of a… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1973-2017
0102019732017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
k-Restricted edge connectivity is an important parameter in measuring the reliability and fault tolerance of large… (More)
Is this relevant?
2003
2003
For a graph G, the P2-path graph, P2(G), has for vertices the set of all paths of length 2 in G. Two vertices are connected when… (More)
Is this relevant?
2002
2002
This paper considers the concept of restricted edge-connectivity, and relates that to the edgedegree of a connected graph. The… (More)
Is this relevant?
1998
1998
Two vertices of an undirected graph are called k -edge-connected if there exist k edge-disjoint paths between them (equivalently… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1998
1998
In the well-solved edge-connectivity augmentation problem we must find a minimum cardinality set F of edges to add to a given… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1989
Highly Cited
1989
For a graph Go = (V,Ef l ) and an integer K, how many edges are needed for augmenting Go to a K-edge-connected graph? Results in… (More)
  • figure 3-1
  • figure 3-2
  • figure 4-1
  • figure 4-2
  • figure 4-3
Is this relevant?
1989
1989
We present two algorithms for finding the edge connectivity of a given directed graph G. The first algorithm runs in O( nm) time… (More)
Is this relevant?
1988
1988
This paper solves the minimum augmentation problem for a given tree and positive integer k, that is, to make a tree k-edge… (More)
Is this relevant?
Highly Cited
1987
Highly Cited
1987
The problem in which the object is to add a minimum weight set of edges to a graph so as to satisfy a given condition is called… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1974
1974
It is shown that if G is a graph of order p 2 2 such that deg u + deg u 2 p 1 for all pairs u, u of nonadjacent vertices, then… (More)
Is this relevant?