Sciweavers

3008 search results - page 447 / 602
» Independence in connected graphs
Sort
View
TIT
2008
122views more  TIT 2008»
15 years 7 months ago
Identifying Codes and Covering Problems
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...
Moshe Laifenfeld, Ari Trachtenberg
TVCG
2008
140views more  TVCG 2008»
15 years 7 months ago
Efficient Morse Decompositions of Vector Fields
Vector field analysis plays a crucial role in many engineering applications, such as weather prediction, tsunami and hurricane study, and airplane and automotive design. Existing ...
Guoning Chen, Konstantin Mischaikow, Robert S. Lar...
DM
2002
95views more  DM 2002»
15 years 6 months ago
On the superconnectivity of generalized p-cycles
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only ...
Camino Balbuena, Ignacio M. Pelayo, J. Góme...
TC
1998
15 years 6 months ago
Regular Sparse Crossbar Concentrators
A bipartite concentrator is a single stage sparse crossbar switching device that can connect any m of its n ≥ m inputs to its m outputs possibly without the ability to distingui...
Weiming Guo, A. Yavuz Oruç
ESWA
2008
166views more  ESWA 2008»
15 years 6 months ago
Modular design to support green life-cycle engineering
The severe competition in the market has driven enterprises to produce a wider variety of products to meet consumers' needs. However, frequent variation of product specificat...
Hwai-En Tseng, Chien-Chen Chang, Jia-Diann Li