36 search results - page 1 / 8 » Independence Free Graphs and Vertex Connectivity Augmentatio... |
IPCO
2001
14 years 11 months ago
2001
98
Voted
ENDM
2008
14 years 10 months ago
2008
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
88
Voted
COMGEO
2008
ACM
14 years 10 months ago
2008
ACM
Let G be a connected plane geometric graph with n vertices. In this paper, we study bounds on the number of edges required to be added to G to obtain 2-vertex or 2-edge connected ...
COMBINATORICS
2006
14 years 10 months ago
2006
A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G. A set S o...
COCOA
2007
Springer
15 years 4 months ago
2007
Springer
We consider the problem of connecting given vertex pairs over a stochastic metric graph, each vertex of which has a probability of presence independently of all other ver