Sciweavers

4865 search results - page 131 / 973
» The Complexity of Graph Connectivity
Sort
View
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
14 years 5 months ago
The Complexity of Solving Stochastic Games on Graphs
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...
Daniel Andersson, Peter Bro Miltersen
APPROX
2009
Springer
195views Algorithms» more  APPROX 2009»
14 years 5 months ago
Approximating Node-Connectivity Augmentation Problems
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...
Zeev Nutov
CPAIOR
2008
Springer
14 years 16 days ago
Connections in Networks: A Hybrid Approach
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...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
ICDE
2006
IEEE
155views Database» more  ICDE 2006»
15 years 3 days ago
Mining, Indexing, and Similarity Search in Graphs and Complex Structures
Jiawei Han, Xifeng Yan, Philip S. Yu