4865 search results - page 131 / 973 » The Complexity of Graph Connectivity |
104
Voted
ISAAC
2009
Springer
15 years 7 months ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
117
click to vote
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
106
click to vote
CPAIOR
2008
Springer
15 years 2 months ago
2008
Springer
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
70
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer