Art

J-GLOBAL ID：201702229308303300   Reference number：17A1149396

A generalization of the minimal dominating set problem and its self-stabilizing algorithm

極小支配集合問題の一般化とその自己安定アルゴリズム

Author (3)： KOBAYASHI Hisaki (Osaka Univ., JPN) ,  KAKUGAWA Hirotsugu (Osaka Univ., JPN) ,  MASUZAWA Toshimitsu (Osaka Univ., JPN)
Material： 電子情報通信学会技術研究報告  (IEICE Technical Report (Institute of Electronics, Information and Communication Engineers))
Volume： 117  Issue： 176(COMP2017 13-19)  Page： 25-32  Publication year： Aug. 11, 2017 
JST Material Number： S0532B  ISSN： 0913-5685  Document type： Proceedings
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *set ,  *graph theory ,  *algorithm ,  convergence ,  *disperse system ,  system model ,  stabilization ,  theorem proving ,  performance evaluation ,  network
Semi thesaurus term： *極小支配集合 ,  *自己安定アルゴリズム ,  self-stabilization ,  同期式ネットワーク

JST classification (2)： Theory of computation  (JB02000A) ,  System and control theory in general  (IA02010H)

Reference (15)：

• E. W. Dijkstra. Self-stabilizing systems in spite of dis-tributed control. Communications of the ACM 17(11), pp.643-644, 1974.
• G. Wang, H. Wang, X. Tao, J. Zhang. A self-stabilizing algorithm for finding a minimal k-dominating set in general networks. In Proceedings of the International Conference on Data and Knowledge Engineering, pp.74-85, 2012.
• G. Wang, H. Wang, X. Tao, J. Zhang and J. Zhang. Min-imising k-dominating set in arbitrary network graphs. In Proceedings of the 9th International Conference on Ad-vanced Data Mining and Applications, pp.120-132, 2013.
• J. F. Fink and M. S. Jacobson. N-domination in graphs. John Wiley and Sons, 1985.
• N. Guellati and H. Kheddouci. A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs. Journal of Parallel and Distributed Computing 70(4), pp.406-415, 2010.

Terms in the title (5)： 支配集合 ,  問題 ,  一般化 ,  自己 ,  アルゴリズム