A memory efficient self-stabilizing algorithm for maximal k-packing

Authors:
Fredrik Manne;Morten Mjelde
Affiliations:
Department of Informatics, University in Bergen, Norway;Department of Informatics, University in Bergen, Norway
Venue:
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Year:
2006

Citing 5
Cited 3

R-Domination in Graphs

Journal of the ACM (JACM)
Self-stabilization

Self-stabilization
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Efficient Self-stabilizing Algorithms for Tree Networks

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
A self-stabilizing algorithm for maximal 2-packing

Nordic Journal of Computing

Distance- k knowledge in self-stabilizing algorithms

Theoretical Computer Science
A self-stabilizing algorithm to maximal 2-packing with improved complexity

Information Processing Letters
Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 memory requirement compared to the previous most memory efficient algorithm [9] which used k variables per node. In addition the presented algorithm is very short and simple.