Efficient Coloring Algorithms for Constructing Smaller Connected Dominating Sets in Wireless Ad Hoc Networks
碩士 === 國立雲林科技大學 === 電機工程系碩士班 === 97 === Given a undirected graph G = (V, E), where V is the node set and E is the link set, if a set A is a subset of set V and each element v in set V either belongs to set A or at least is connected to one element of set A, then set A is a dominating set (DS) of set...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/60007305157280828995 |