11381 search results - page 146 / 2277 » Connectivity |
142
Voted
ENDM
2010
15 years 3 months ago
2010
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...
102
click to vote
IJON
2006
15 years 3 months ago
2006
Modeling studies have shown that recurrent interactions within neural networks are capable of self-sustaining non-uniform activity profiles. These patterns are thought to be the n...
141
click to vote
IJWIN
2006
15 years 3 months ago
2006
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...
116
click to vote
JCT
2008
15 years 3 months ago
2008
The old well-known result of Chartrand, Kaugars and Lick [1] says that every k-connected graph G with minimum degree at least 3k/2 has a vertex v such that G - v is still k-connec...
121
click to vote
JSAT
2006
15 years 3 months ago
2006
Many SAT instances can be decomposed into connected components either initially after preprocessing or during the solution phase when new unit conflict clauses are learned. This o...