Sciweavers

618 search results - page 5 / 124
» Short cycle connectivity
Sort
View
DM
2007
135views more  DM 2007»
13 years 7 months ago
Heavy fans, cycles and paths in weighted graphs of large connectivity
A set of paths joining a vertex y and a vertex set L is called (y, L)-fan if any two of the paths have only y in common, and its width is the number of paths forming it. In weight...
Jun Fujisawa
ICN
2005
Springer
14 years 26 days ago
Cube Connected Cycles Based Bluetooth Scatternet Formation
Bluetooth is a wireless communication standard developed for personal area networks (PAN) that gained popularity in the last years. In its design it was meant to connect a few dev...
Marcin Bienkowski, André Brinkmann, Mirosla...
ESA
1997
Springer
93views Algorithms» more  ESA 1997»
13 years 11 months ago
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
Madhukar R. Korupolu, Vijaya Ramachandran
IPPS
2005
IEEE
14 years 28 days ago
Partial Clustering: Maintaining Connectivity in a Low Duty-Cycled Dense Wireless Sensor Network
— We consider a dense wireless sensor network where the radio transceivers of the sensor nodes are heavily duty-cycled in order to conserve energy. The chief purpose of the senso...
Chih-fan Hsin, Mingyan Liu
VLSID
1996
IEEE
106views VLSI» more  VLSID 1996»
13 years 11 months ago
VLSI/WSI Designs for Folded Cube-Connected Cycles Architectures
This paper presents VLSI/WSI designs for a recently introduced parallel architecture known as the folded cube-connected cycles (FCCC). We first discuss two layouts for the FCCC, i...
M. P. Sebastian, P. S. Nagendra Rao, Lawrence Jenk...