An efficient self-stabilizing algorithm for the minimal dominating set problem under a distributed scheduler

碩士 === 國立交通大學 === 應用數學系所 === 99 === This thesis considers designing efficient self-stabilizing algorithms for solving the minimal dominating set (MDS) problem. Let n denote the number of nodes in a distributed system. A self-stabilizing algorithm is said to be a t-move algorithm if when it is used,...

Full description

Bibliographic Details
Main Authors: Tsai, Shih-Yu, 蔡詩妤
Other Authors: Chen, Chiu-Yuan
Format: Others
Language:en_US
Published: 2011
Online Access:http://ndltd.ncl.edu.tw/handle/74236640136435484042

Similar Items