Sciweavers

2354 search results - page 44 / 471
» Radio number for trees
Sort
View
EJC
2008
14 years 9 months ago
On Postnikov's hook length formula for binary trees
We present a combinatorial proof of Postnikov's hook length formula for binary trees. c 2007 Elsevier Ltd. All rights reserved. Let [n] = {1, 2, . . . , n}. It is well known ...
William Y. C. Chen, Laura L. M. Yang
JCM
2006
76views more  JCM 2006»
14 years 9 months ago
Hierarchical Aggregation of Multicast Trees in Large Domains
Multicast tree aggregation is a technique that reduces the control overhead and the number of states induced by multicast. The main idea of this protocol is to route several groups...
Joanna Moulierac, Alexandre Guitton, Miklós...
INFOCOM
2009
IEEE
15 years 4 months ago
Coalitional Games for Distributed Collaborative Spectrum Sensing in Cognitive Radio Networks
— Collaborative spectrum sensing among secondary users (SUs) in cognitive networks is shown to yield a significant performance improvement. However, there exists an inherent tra...
Walid Saad, Zhu Han, Mérouane Debbah, Are H...
JNCA
2007
106views more  JNCA 2007»
14 years 9 months ago
Relay reduction and disjoint routes construction for scatternet over Bluetooth radio system
Bluetooth is a new technology for low-cost, low-power, and short-range wireless communication. By constructing a piconet, Bluetooth device establishes link and communicates with o...
Gwo-Jong Yu, Chih-Yung Chang, Kuei-Ping Shih, Shih...
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
15 years 7 months ago
Fully-Functional Succinct Trees
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
Kunihiko Sadakane, Gonzalo Navarro