618 search results - page 25 / 124 » Short cycle connectivity |
80
Voted
TCS
2010
14 years 8 months ago
2010
— Rahman and Kaykobad introduced a shortest distance based condition for finding the existence of Hamiltonian paths in graphs as follows: Let G be a connected graph with n vertic...
SASO
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract—We present a distributed connectivity service that allows agents in a mobile ad-hoc network to move while preserving connectivity. This allows unmodified motion plannin...
IJCAI
2007
14 years 11 months ago
2007
Most AI diagnostic reasoning approaches model components and but not their interconnections, and when they do model interconnections, they model the possibility that a connection ...
HPN
1994
14 years 11 months ago
1994
Dynamic synchronous Transfer Mode (DTM) is a new protocol suite based on synchronous fast circuit switching. The DTM network is based on bandwidth reservation and supports dynamic...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract—In [1], the author presented a 1+N protection strategy against single link failures using a network coding approach on p-Cycles. In this paper, we extend this approach t...