Self-Stabilizing Algorithms for Maximal 2-packing and General k-packing (k ≥ 2) with Safe Convergence in an Arbitrary Graph
نویسندگان
چکیده
منابع مشابه
Self-Stabilizing Algorithms for Maximal 2-packing and General k-packing (k ≥ 2) with Safe Convergence in an Arbitrary Graph
In a graph or a network G = (V,E), a set S ⊆ V is a 2-packing if ∀i ∈ V : |N [i] ∩ S| ≤ 1, where N [i] denotes the closed neighborhood of node i. A 2-packing is maximal if no proper superset of S is a 2-packing. This paper presents a safely converging self-stabilizing algorithm for maximal 2-packing problem. Under a synchronous daemon, it quickly converges to a 2packing (a safe state, not neces...
متن کاملA Memory Efficient Self-stabilizing Algorithm for Maximal k -Packing
The k-packing problem asks for a subset S of the nodes in a graph such that the distance between any pair of nodes in S is greater than k. This problem has applications to placing facilities in a network. In the current paper we present a self-stabilizing algorithm for computing a maximal k-packing in a general graph. Our algorithm uses a constant number of variables per node. This improves the...
متن کاملA New Self-stabilizing Algorithm for Maximal 2-packing
In the self-stabilizing algorithmic paradigm, each node has a local view of the system, in a finite amount of time the system converges to a global state with desired property. In a graph , a subset is a -packing if . In this paper, an ID-based, constant space, self-stabilizing algorithm that stabilizes to a maximal -packing in an arbitrary graph is proposed. It is shown that the algorithm stab...
متن کاملA Self-stabilizing Algorithm for Maximal 2-packing
In the self-stabilizing algorithmic paradigm for distributed computing each node has only a local view of the system, yet in a finite amount of time the system converges to a global state, satisfying some desired property. In a graph G = (V, E), a subset S ⊆ V is a 2-packing if ∀u ∈ V : |N [u] ∩ S| ≤ 1. In this paper we present an ID-based, selfstabilizing algorithm for finding a maximal 2-pack...
متن کاملAn Updated Self-stabilizing Algorithm to Maximal 2-packing and A Linear Variation under Synchronous Daemon
In this paper, we first propose an ID-based, constant space, self-stabilizing algorithm that stabilizes to a maximal 2-packing in an arbitrary graph. Using a graph G = (V,E) to represent the network, a subset S ⊆ V is a 2-packing if ∀i ∈ V : |N [i] ∩ S| ≤ 1. Self-stabilization is a paradigm such that each node has a local view of the system, in a finite amount of time the system converges to a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Networking and Computing
سال: 2015
ISSN: 2185-2839,2185-2847
DOI: 10.15803/ijnc.5.1_105