Connected Dominating Set of Hypercubes and Star Graphs
碩士 === 明新科技大學 === 資訊管理研究所 === 100 === In wired or wireless networks, routing efficiently among immobile or mobile devices is an important issue. A connected dominating set (CDS) brings benefits to network routing. The CDS can be served as a virtual backbone of a network, and it always adapted ea...
Main Author: | 許雅綾 |
---|---|
Other Authors: | 陳玉專 |
Format: | Others |
Language: | en_US |
Published: |
2011
|
Online Access: | http://ndltd.ncl.edu.tw/handle/82374709531160994459 |
Similar Items
-
Construction Schemes of Connected Dominating Set on Hypercubes
by: HE-MINE CHE, et al.
Published: (2014) -
Efficient all-to-all broadcasting in the hypercube and star graph interconnection networks
by: Ren, Shi Min, et al.
Published: (1996) -
A study of multicast problem in the hypercube and star graph interconnection networks
by: Du, Ming Zhi, et al.
Published: (1996) -
Algorithm-Based Fault-Tolerant Strategies in Faulty Hypercube and Star Graph Multicomputers
by: Chen Yuh Shyan, et al.
Published: (1996) -
Maximum induced subgraph of the generalized hypercube graph
by: 田雅鈞
Published: (2008)