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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berge, C.: Theory of Graphs and its Applications. In: Collection Universitaire de Mathematiques, Dunod, Paris, vol. 2 (1958)
Blair, J., Manne, F.: Efficient self-stabilzing algorithms for tree networks. In: Proceedings of ICDS 2003, The 23rd IEEE International Conference on Distributed Computing Systems, pp. 20–26 (2003)
Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. CACM 17, 643–644 (1974)
Dolev, S.: Self-stabilization. MIT press, Cambridge (2000)
Gairing, M., Geist, R.M., Hedetniemi, S.T., Kristiansen, P.: A self-stabilizing algorithm for maximal 2-packing. Nordic J. Comput. 11, 1–11 (2004)
Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman and Co., New York (1978)
Gärtner, F.: A survey of self-stabilizing spanning-tree algorithms, Tech. Report IC/2003/38, Swiss Federal Institute of Technology (2003)
Goddard, W., et al.: Distance-k information in self-stabilizing algorithms. In: Flocchini, P., Gąsieniec, L. (eds.) SIROCCO 2006. LNCS, vol. 4056, pp. 349–356. Springer, Heidelberg (2006)
Goddard, W., Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Self-stabilizing global optimization algorithms for large network graphs. Int. J. Dist. Sensor Networks 1, 329–344 (2005)
Henning, M.A.: Distance domination in graphs. In: Haynes, T.W., Hedetniemi, S.T., Slater, P.J. (eds.) Domination in Graphs: Advanced Topics, pp. 321–349. Marcel Dekker, New York (1998)
Mjelde, M.: k-packing and k-domination on tree graphs, master’s thesis, Department of Informatics, University of Bergen, Norway (2004)
Ore, O.: Theory of Graphs, vol. 38. American Mathematical Society Publications, AMS, Providence (1962)
Slater, P.J.: R-domination in graphs. J. Assoc. Comput. Mach. 23, 446–450 (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Manne, F., Mjelde, M. (2006). A Memory Efficient Self-stabilizing Algorithm for Maximal k-Packing. In: Datta, A.K., Gradinariu, M. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2006. Lecture Notes in Computer Science, vol 4280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49823-0_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-49823-0_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49018-0
Online ISBN: 978-3-540-49823-0
eBook Packages: Computer ScienceComputer Science (R0)