Sciweavers

618 search results - page 25 / 124
» Short cycle connectivity
Sort
View
TCS
2010
13 years 8 months ago
A comprehensive analysis of degree based condition for Hamiltonian cycles
— 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...
Md. Kamrul Hasan, Mohammad Kaykobad, Young-Koo Lee...
SASO
2008
IEEE
14 years 4 months ago
Connectivity Service for Mobile Ad-Hoc Networks
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...
Alejandro Cornejo, Nancy A. Lynch
IJCAI
2007
13 years 11 months ago
Modeling When Connections Are the Problem
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 ...
Johan de Kleer
HPN
1994
13 years 11 months ago
Fast Connection Establishment in the DTM Gigabit Network
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...
Per Lindgren, Christer Bohm
ICC
2007
IEEE
149views Communications» more  ICC 2007»
14 years 4 months ago
1+N Protection Against Multiple Link Failures in Mesh Networks
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...
Ahmed E. Kamal