Selective Family and Broadcasting on Unknown Radio Networks
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 93 === We study the problem of (n,k)-selective family: Let [n] = {1,…,n} and let k < n. A family S of subsets of [n] is an (n,k)-selective family if, for every subset f of [n] such that 1 < | f | < k, there is a set s in S such that . The concept of selectiv...
Main Authors: | Wen-Chin Tien, 田文錦 |
---|---|
Other Authors: | 趙坤茂 |
Format: | Others |
Language: | en_US |
Published: |
2005
|
Online Access: | http://ndltd.ncl.edu.tw/handle/60708019734012538253 |
Similar Items
-
Broadcasting Problem in Communication Networks
by: Gen-Wen Tien, et al.
Published: (2000) -
Broadcasting in unreliable radio networks
by: Kuhn, Fabian, et al.
Published: (2011) -
Radio advertising and radio broadcasting.
by: Tatton, Gerald R.
Published: (2014) -
Digital Radio Broadcasting Network in the Arctic Region
by: Oleg Varlamov, et al.
Published: (2019-04-01) -
Randomized broadcast in radio networks with collision detection
by: Ghaffari, Mohsen, et al.
Published: (2016)