Self-stabilizing minimal dominating set algorithms of distributed systems and the signed star domination number of Cayley graphs
博士 === 國立交通大學 === 應用數學系所 === 102 === The study of the domination problem in graph theory began in the nineteen-sixties. A distributed system such as an ad hoc network can be modeled by an undirected simple graph G = (V;E), where V represents the set of nodes (i.e., processes) and E represents the se...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/28741059665723204862 |