{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T12:25:33Z","timestamp":1769689533744,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540404538","type":"print"},{"value":"9783540450320","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45032-7_4","type":"book-chapter","created":{"date-parts":[[2007,2,28]],"date-time":"2007-02-28T07:13:49Z","timestamp":1172646829000},"page":"49-60","source":"Crossref","is-referenced-by-count":7,"title":["Self-Stabilizing Algorithms for {k}-Domination"],"prefix":"10.1007","author":[{"given":"Martin","family":"Gairing","sequence":"first","affiliation":[]},{"given":"Stephen T.","family":"Hedetniemi","sequence":"additional","affiliation":[]},{"given":"Petter","family":"Kristiansen","sequence":"additional","affiliation":[]},{"given":"Alice A.","family":"McRae","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,5,27]]},"reference":[{"key":"4_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/3-540-40026-5_15","volume-title":"DISC00 Distributed Computing 14th International Symposium","author":"J. Beauquier","year":"2000","unstructured":"J. Beauquier, A.K. Datta, M. Gradinariu, and F. Magniette. Self-stabilizing local mutual exclusion and daemon refinement. In DISC00 Distributed Computing 14th International Symposium, Springer LNCS: 1914, pages 223\u2013237, 2000. 50"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E. W. Dijkstra","year":"1974","unstructured":"E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. Communications of the ACM, 17:643\u2013644, 1974. 50","journal-title":"Communications of the ACM"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"S. Dolev. Self-stabilization. MIT Press, 2000. 50","DOI":"10.7551\/mitpress\/6156.001.0001"},{"key":"4_CR4","unstructured":"G. S. Domke. Variations of Colorings, Coverings, and Packings of Graphs. PhD thesis, Clemson University, 1988. 50"},{"key":"4_CR5","unstructured":"G. S. Domke, S.T. Hedetniemi, R.C. Laskar, and G. Fricke. Relationships between integer and fractional parameters of graphs. In Y. Alavi, G. Chartrand, O. R. Ollermann, and A. J. Schwenk, editors, Graph Theory, Combinatorics, and Applications, Proceedings of the Sixth Quadrennial Conference on the Theory and Applications of Graphs (Kalamazoo, MI, 1988), volume 2, pages 371\u2013387. Wiley, 1991. 50"},{"key":"4_CR6","unstructured":"M. Gairing, R.M. Geist, S.T. Hedetniemi, and P. Kristiansen. A self-stabilizing algorithm for maximal 2-packing. Technical Report 230, Department of Informatics, University of Bergen, 2002. 52"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"W. Goddard, S.T. Hedetniemi, D.P. Jacobs, and P.K. Srimani. A self-stabilizing distributed algorithm for minimal total domination in an arbitrary system graph. In Proceedings of the 8th International Workshop on Formal Methods for Parallel Programming: Theory and Applications (FMPPTA\u201903) in conjunction with IPDPS\u201903, 2003. 59","DOI":"10.1109\/IPDPS.2003.1213437"},{"key":"4_CR8","unstructured":"T.W. Haynes, S.T. Hedetniemi, and P. J. Slater. Fundamentals of Domination in Graphs. Marcel Dekker, 1998. 50"},{"key":"4_CR9","unstructured":"S.M. Hedetniemi, S.T. Hedetniemi, D.P. Jacobs, and P.K. Srimani. Self-stabilizing algorithm for minimal dominating and maximal independent sets. Comput. Math. Appl., to appear. 56"},{"key":"4_CR10","unstructured":"S. T. Hedetniemi, D.P. Jacobs, and P.K. Srimani. Maximal matching stabilizes in time O(m). Information Processing Letters, to appear. 50"},{"issue":"2","key":"4_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0020-0190(92)90015-N","volume":"43","author":"S.-C. Hsu","year":"1992","unstructured":"Su-Chu Hsu and Shing-Tsaan Huang. A self-stabilizing algorithm for maximal matching. Information Processing Letters, 43(2):77\u201381, 1992. 50","journal-title":"Information Processing Letters"},{"key":"4_CR12","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. M. Karp","year":"1972","unstructured":"R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thathcher, editors, Complexity of Computer Computations, pages 85\u2013103. Plenum Press, New York, 1972. 51"},{"issue":"6","key":"4_CR13","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0020-0190(94)90098-1","volume":"49","author":"G. Tel","year":"1994","unstructured":"G. Tel. Maximal matching stabilizes in quadratic time. Information Processing Letters, 49(6):271\u2013272, 1994. 50","journal-title":"Information Processing Letters"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"G. Tel. Introduction to distributed algorithms. Cambridge University Press, second edition, 2000. 50","DOI":"10.1017\/CBO9781139168724"}],"container-title":["Lecture Notes in Computer Science","Self-Stabilizing Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45032-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T21:55:17Z","timestamp":1550267717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45032-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404538","9783540450320"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45032-7_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}