self-stabilization is a theoretical framework of non-masking fault-tolerant distributedalgorithms. In this paper, we investigate a self-stabilizingdistributed approximation for the minimum k-dominating set (KDS) pro...
详细信息
self-stabilization is a theoretical framework of non-masking fault-tolerant distributedalgorithms. In this paper, we investigate a self-stabilizingdistributed approximation for the minimum k-dominating set (KDS) problem in general networks. The minimum KDS problem is a generalization of the well-known dominating set problem in graph theory. For a graph G = (V, E), a set D-k subset of V is a KDS of G if and only if each vertex not in Dk is adjacent to at least k vertices in D-k. The approximation ratio of our algorithm is (Delta)/(k)(1+(k-1)/(Delta+1)), where Delta is the maximum degree of G, in the networks of which the minimum degree is more than or equal to k.
self-stabilization is a theoretical framework of non-masking fault-tolerant distributedalgorithms. In this paper, we investigate self-stabilizingdistributed solutions to the minimal k-redundant dominating set (MRDS)...
详细信息
ISBN:
(纸本)0780378407
self-stabilization is a theoretical framework of non-masking fault-tolerant distributedalgorithms. In this paper, we investigate self-stabilizingdistributed solutions to the minimal k-redundant dominating set (MRDS) problem in tree networks. The MRDS problem is a generalization of the well-known dominating set problem in graph theory. For a graph G=(VE), a set M subset of or equal to V is a k-redundant dominating set of G if and only if each vertex not in M is adjacent to at least k vertices in M. We propose a self-stabilizing distributed algorithm that solves the MRDS problem for anonymous tree networks.
self-stabilization is a theoretical framework of non-masking fault-tolerant distributedalgorithms. In this paper, we investigate self-stabilizingdistributed solutions to the minimal k-redundant dominating set (MRDS)...
详细信息
self-stabilization is a theoretical framework of non-masking fault-tolerant distributedalgorithms. In this paper, we investigate self-stabilizingdistributed solutions to the minimal k-redundant dominating set (MRDS) problem in tree networks. The MRDS problem is a generalization of the well-known dominating set problem in graph theory. For a graph G=(V,E), a set M(C) V is a k-redundant dominating set of G if and only if each vertex not in M is adjacent to at least k vertices in M. We propose a self-stabilizing distributed algorithm that solves the MRDS problem for anonymous tree networks.
self-stabilization is a theoretical framework of non-masking fault-tolerant distributed *** this paper,we investigate self-stabilizingdistributed solutions to the minimal k-redundant dominating set(MRDS) problem in t...
详细信息
self-stabilization is a theoretical framework of non-masking fault-tolerant distributed *** this paper,we investigate self-stabilizingdistributed solutions to the minimal k-redundant dominating set(MRDS) problem in tree *** MRDS problem is a generalization of the well-known dominating set problem in graph *** a graph G=(V,E),a set M(?)V is a k-redundant dominating set of G if and only if each vertex not in M is adjacent to at least k vertices in *** propose a self-stabilizing distributed algorithm that solves the MRDS problem for anonymous tree networks.
暂无评论