Affiliation:
1. Faculty of Advanced Science and Technology Ryukoku University Otsu Shiga Japan
2. Department of Information Engineering Hiroshima University Higashi Hiroshima Hiroshima Japan
Abstract
SummaryThe domination problem is one of the fundamental graph problems, and there are many variations. In this article, we propose a new problem called the minus ‐domination problem where , and are integers such that , , and . The problem is to assign a value from for each vertex in a graph such that the local summation of values is greater than or equal to . We also propose a framework named the bounded lattice domination for a class of domination problems, including the minus ‐domination problem. Then, we present a self‐stabilizing distributed algorithm under the distance‐2 model for the bounded lattice domination. Here, self‐stabilization is a class of fault‐tolerant distributed algorithms that tolerate transient faults. The time complexity for convergence is , where is the number of processes in a network if the cardinality of the domain of process values is finite and constant. Otherwise, the time complexity for convergence is .
Funder
Japan Society for the Promotion of Science
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Computer Science Applications,Theoretical Computer Science,Software
Reference29 articles.
1. The algorithmic complexity of minus domination in graphs
2. Minus domination in graphs
3. Self-stabilizing systems in spite of distributed control
4. ShuklaSK RosenkrantzDJ RaviSS.Observations on self‐stabilizing graph algorithms for anonymous networks. Proceedings of the Second Workshop on Self‐Stabilizing Systems (WSS); 1995:7.1–7.15.