618 search results - page 13 / 124 » Short cycle connectivity |
ARSCOM
2004
13 years 9 months ago
2004
We show that in any graph G on n vertices with d(x) + d(y) n for any two nonadjacent vertices x and y, we can fix the order of k vertices on a given cycle and find a hamiltonian c...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
We present a short way of proving the inequalities obtained by Wright in [Journal of Graph Theory, 4: 393 – 407 (1980)] concerning the number of connected graphs with ℓ edges m...
IMC
2005
ACM
14 years 3 months ago
2005
ACM
In some contexts it may be useful to predict the latency for short TCP transfers. For example, a Web server could automatically tailor its content depending on the network path to...
CN
2010
13 years 9 months ago
2010
In WDM networks, it is important to protect connections against link failures due to the high bandwidth provided by a fiber link. Although many p-cycle based schemes have been pro...