4865 search results - page 543 / 973 » The Complexity of Graph Connectivity |
175
click to vote
OPODIS
2008
15 years 8 months ago
2008
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
201
Voted
APVIS
2009
15 years 8 months ago
2009
We present a correlation study of time-varying multivariate volumetric data sets. In most scientific disciplines, to test hypotheses and discover insights, scientists are interest...
167
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We consider the problem of self-healing in networks that are reconfigurable in the sense that they can change their topology during an attack. Our goal is to maintain connectivity...
214
Voted
ALGORITHMICA
2006
15 years 7 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
146
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
—In this paper, we conduct extensive simulations to understand the properties of the overlay generated by BitTorrent. We start by analyzing how the overlay properties impact the ...