3008 search results - page 165 / 602 » Independence in connected graphs |
208
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—We address pairwise and (for the first time) triple key establishment problems in wireless sensor networks (WSN). We use combinatorial designs to establish pairwise keys betwee...
170
click to vote
WG
2005
Springer
15 years 12 months ago
2005
Springer
We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large’ induced subgraph H, where H has treewidth at most t and every vertex in ...
174
click to vote
JBI
2004
15 years 7 months ago
2004
Metabolism can be regarded as a network of biochemical reactions, connected via their substrates and products. A metabolic pathway is thus a coordinated series of reactions, and i...
162
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study Maker-Breaker games played on the edge set of a random graph. Specifically, we consider the random graph process and analyze the first time in a typical random graph proc...
165
click to vote
ICCAD
1999
IEEE
15 years 10 months ago
1999
IEEE
Algorithmic logic synthesis is usually carried out in two stages, the independent stage where logic minimization is performed on the Boolean equations with no regard to physical p...