4865 search results - page 168 / 973 » The Complexity of Graph Connectivity |
131
Voted
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
120
Voted
SIGMETRICS
2006
ACM
15 years 9 months ago
2006
ACM
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
115
click to vote
LADC
2007
Springer
15 years 9 months ago
2007
Springer
A distributed dynamic system is a fully distributed system subject to a continual arrival/departure of the entities defining the system. Another characterizing dimension of these ...
151
click to vote
CPAIOR
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We investigate mathematical formulations and solution techniques for a variant of the Connected Subgraph Problem. Given a connected graph with costs and profits associat...
127
Voted
COMBINATORICS
2000
15 years 3 months ago
2000
Consider a connected r-regular n-vertex graph G with random independent edge lengths, each uniformly distributed on [0, 1]. Let mst(G) be the expected length of a minimum spanning...