3008 search results - page 416 / 602 » Independence in connected graphs |
166
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 ...
193
click to vote
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...
179
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
The Jordan Curve Theorem (JCT) states that a simple closed curve divides the plane into exactly two connected regions. We formalize and prove the theorem in the context of grid gr...
160
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...
203
click to vote
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)...